New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Jump to bottom

More efficient LCP computation for simple texts. #3

Open

kurpicz opened this issue Jan 11, 2015 · 0 comments

Labels

Milestone

Code cleanup and ...

Owner

kurpicz commented Jan 11, 2015

Currently the LCP is computed naively if there is at most S*-suffix in the text. A more efficient algorithm would be preferred,

kurpicz added the enhancement label

kurpicz added this to the Code cleanup and documentation milestone

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment