Skip to content
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

Implement longest common prefix algorithms #53

Open
5 tasks
krzysztof-turowski opened this issue Sep 14, 2023 · 0 comments
Open
5 tasks

Implement longest common prefix algorithms #53

krzysztof-turowski opened this issue Sep 14, 2023 · 0 comments
Labels
documentation Improvements or additions to documentation enhancement New feature or request

Comments

@krzysztof-turowski
Copy link
Owner

  • Fischer - Inducing the LCP-Array
  • Gog, Ohlebusch - Compressed Suffix Trees: Efficient Computation and Storage of LCP-Values (conference version: Fast and Lightweight LCP-Array Construction Algorithms)
  • Manzini - Two Space Saving Tricks for Linear Time LCP Array Computation
  • Puglisi, Turpin - Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
  • Sadakane - Succinct Representations of lcp Information and Improvements in the Compressed Suffix Arrays
@krzysztof-turowski krzysztof-turowski added documentation Improvements or additions to documentation enhancement New feature or request labels Sep 14, 2023
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment
Assignees
No one assigned
Labels
documentation Improvements or additions to documentation enhancement New feature or request
Projects
None yet
Milestone
No milestone
Development

No branches or pull requests
1 participant
@krzysztof-turowski