Jump to content

Existing user? Sign In
Sign In

Remember me Not recommended on shared computers

Forgot your password?

Or sign in with one of these services
Sign Up

Browse
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
- More
Activity
- All Activity
- Search
- More
Leaderboard
More
- More

Computer Science

thesis help

arindam_1002

By arindam_1002
September 20, 2012 in Computer Science

Share

https://www.scienceforums.net/topic/69159-thesis-help/

Recommended Posts

arindam_1002

arindam_1002

Posted September 20, 2012

Posted September 20, 2012

I am pursuing my ME.I want some help for my thesis.can anybody tell me is suffix tree tree can be applicable to find longest common subsequence...

ecoli

Posted September 20, 2012

Posted September 20, 2012

should be O(n log(n))

1 month later...

khaled

khaled

Posted October 31, 2012

Posted October 31, 2012

Suffix Tree can be optimized for that purpose.

Create an account or sign in to comment

You need to be a member in order to leave a comment

Create an account

Sign up for a new account in our community. It's easy!

Register a new account

Sign in

Already have an account? Sign in here.

Sign In Now

Share

https://www.scienceforums.net/topic/69159-thesis-help/

Go to topic listing

×

Browse
- Back
- Forums
- Events
- Guidelines
- Staff
- Online Users
- Leaderboard
Activity
- Back
- All Activity
- Search
Leaderboard

×

Create New...

Important Information

We have placed cookies on your device to help make this website better. You can adjust your cookie settings, otherwise we'll assume you're okay to continue.