Computing suffix links for suffix trees and arrays
From MaRDI portal
Publication:845941
DOI10.1016/j.ipl.2005.12.012zbMath1184.68607OpenAlexW2160738675MaRDI QIDQ845941
Publication date: 29 January 2010
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ipl.2005.12.012
Related Items
\(k\)-abelian pattern matching, The affix array data structure and its applications to RNA secondary structure analysis
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Replacing suffix trees with enhanced suffix arrays
- Sublinear approximate string matching and biological applications
- From Ukkonen to McCreight and Weiner: A unifying view of linear-time suffix tree construction
- Linear time algorithms for finding and representing all the tandem repeats in a string
- On-line construction of suffix trees
- Suffix Arrays: A New Method for On-Line String Searches
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Lowest common ancestors in trees and directed acyclic graphs
