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

DOI10.1007/S11786-010-0033-6zbMath1205.68496OpenAlexW2067675443MaRDI QIDQ626893

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

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

repetitionsuffix arraysuffix treerepeat

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Combinatorics on words (68R15) Permutations, words, matrices (05A05) Algorithms on strings (68W32)

Related Items (6)

Efficient computation of substring equivalence classes with suffix arrays ⋮ Fast, practical algorithms for computing all the repeats in a string ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ String covering with optimal covers ⋮ Computing regularities in strings: a survey ⋮ New complexity results for the \(k\)-covers problem

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

This page was built for publication: Fast, practical algorithms for computing all the repeats in a string