arindam_1002 Posted September 20, 2012 Share 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... Link to comment Share on other sites More sharing options...
ecoli Posted September 20, 2012 Share Posted September 20, 2012 should be O(n log(n)) Link to comment Share on other sites More sharing options...
khaled Posted October 31, 2012 Share Posted October 31, 2012 Suffix Tree can be optimized for that purpose. Link to comment Share on other sites More sharing options...
Recommended Posts
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 accountSign in
Already have an account? Sign in here.
Sign In Now