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

DOI10.1016/j.jda.2015.05.005zbMath1336.68318OpenAlexW422844602MaRDI QIDQ491149

Enno Ohlebusch, Timo Beller

Publication date: 24 August 2015

Published in: Journal of Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jda.2015.05.005

zbMATH Keywords

maximal repeatsenhanced suffix arraycontext-diverse repeatsnear-supermaximal repeatssupermaximal repeats

Mathematics Subject Classification ID

Algorithms on strings (68W32)

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
• On-line construction of compact suffix vectors and maximal repeats
• On maximal repeats in strings
• Space-Efficient Preprocessing Schemes for Range Minimum Queries on Static Arrays
• Fast Algorithms for Finding Nearest Common Ancestors
• A Compressed Enhanced Suffix Array Supporting Fast String Matching
• Efficient Computation of Substring Equivalence Classes with Suffix Arrays
• Permuted Longest-Common-Prefix Array
• Algorithms on Strings, Trees and Sequences
• On Context-Diverse Repeats and Their Incremental Computation