What would be the best approach (performance-wise) in solving this problem?
I was recommended to use suffix trees. Is this the best approach?
What would be the best approach (performance-wise) in solving this problem? I was recommended
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
What would be the best approach (performance-wise) in solving this problem?
I was recommended to use suffix trees. Is this the best approach?
Have a look at http://en.wikipedia.org/wiki/Suffix_array as well – they are quite space-efficient and have some reasonably programmable algorithms to produce them, such as “Simple Linear Work Suffix Array Construction” by Karkkainen and Sanders