Fast, practical algorithms for computing all the repeats in a string

DOI10.1007/s11786-010-0033-6zbMath1205.68496MaRDI QIDQ626893

W. F. Smyth, Simon J. Puglisi, Munina Yusufu

Publication date: 19 February 2011

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

Full work available at URL: http://hdl.handle.net/20.500.11937/36774

zbMATH Keywords

repetition; suffix array; suffix tree; repeat

Mathematics Subject Classification ID

68W05: Nonnumerical algorithms

68R15: Combinatorics on words

05A05: Permutations, words, matrices

68W32: Algorithms on strings

Related Items

Alphabet-independent algorithms for finding context-sensitive repeats in linear time, New complexity results for the \(k\)-covers problem, Fast, practical algorithms for computing all the repeats in a string, Computing regularities in strings: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast, practical algorithms for computing all the repeats in a string
• Replacing suffix trees with enhanced suffix arrays
• Engineering a lightweight suffix array construction algorithm
• Efficient Computation of Substring Equivalence Classes with Suffix Arrays
• Space Efficient Linear Time Construction of Suffix Arrays
• Space-Time Tradeoffs for Longest-Common-Prefix Array Computation
• New approaches for computer analysis of nucleic acid sequences.
• Algorithms on Strings, Trees and Sequences
• Algorithm Theory - SWAT 2004