On maximal repeats in strings

DOI10.1016/S0020-0190(01)00152-1zbMath1032.68066MaRDI QIDQ1603378

Mathieu Raffinot

Publication date: 14 July 2002

Published in: Information Processing Letters (Search for Journal in Brave)

zbMATH Keywords

Data structuresInformation processingCompact suffix automatonMaximal repeats

Mathematics Subject Classification ID

Data structures (68P05)

Related Items (10)

On Sturmian graphs ⋮ Composite Repetition-Aware Data Structures ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ Fast Label Extraction in the CDAWG ⋮ Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression ⋮ \(xkcd\)-repeats: a new taxonomy of repeats defined by their context diversity ⋮ On-line construction of compact suffix vectors and maximal repeats ⋮ Flexible indexing of repetitive collections ⋮ Unnamed Item ⋮ Unnamed Item

Cites Work

• Average sizes of suffix trees and DAWGs
• On-line construction of suffix trees
• Algorithms on Strings, Trees and Sequences
• Complete inverted files for efficient text retrieval and analysis
• Unnamed Item

This page was built for publication: On maximal repeats in strings