On-line construction of compact suffix vectors and maximal repeats

DOI10.1016/j.tcs.2008.06.017zbMath1154.68044OpenAlexW2164921635MaRDI QIDQ955004

Élise Prieur, Thierry Lecroq

Publication date: 18 November 2008

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.017

zbMATH Keywords

suffix treesmaximal repeatscompact suffix automatadesign of analysissuffix vectors

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Formal languages and automata (68Q45) Data structures (68P05)

Related Items

Alphabet-independent algorithms for finding context-sensitive repeats in linear time

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Replacing suffix trees with enhanced suffix arrays
• On maximal repeats in strings
• On-line construction of suffix trees
• Space Efficient Suffix Trees
• From Suffix Trees to Suffix Vectors
• Distributed and Paged Suffix Trees for Large Genetic Databases
• A Space-Economical Suffix Tree Construction Algorithm
• Algorithms on Strings, Trees and Sequences
• On-Line Linear-Time Construction of Word Suffix Trees
• Algorithms and Computation