On maximal repeats in strings
From MaRDI portal
Publication:1603378
DOI10.1016/S0020-0190(01)00152-1zbMath1032.68066MaRDI QIDQ1603378
Publication date: 14 July 2002
Published in: Information Processing Letters (Search for Journal in Brave)
68P05: Data structures
Related Items
Alphabet-independent algorithms for finding context-sensitive repeats in linear time, On Sturmian graphs, On-line construction of compact suffix vectors and maximal repeats, Composite Repetition-Aware Data Structures
Cites Work