Linear time algorithm for the longest common repeat problem
From MaRDI portal
Publication:2457296
DOI10.1016/j.jda.2006.03.019zbMath1127.68114OpenAlexW2065776278MaRDI QIDQ2457296
Costas S. Iliopoulos, Inbok Lee, Kun Soo Park
Publication date: 30 October 2007
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.03.019
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- On-line construction of suffix trees
- Fast Algorithms for Finding Nearest Common Ancestors
- On Finding Lowest Common Ancestors: Simplification and Parallelization
- A Space-Economical Suffix Tree Construction Algorithm
- All Highest Scoring Paths in Weighted Grid Graphs and Their Application to Finding All Approximate Repeats in Strings
- Algorithms on Strings, Trees and Sequences
- On the sorting-complexity of suffix tree construction