Efficient Computation of Substring Equivalence Classes with Suffix Arrays

DOI10.1007/978-3-540-73437-6_34zbMath1138.68377OpenAlexW1561328404MaRDI QIDQ3506935

Hideo Bannai, Kazuyuki Narisawa, Masayuki Takeda, Shunsuke Inenaga

Publication date: 17 June 2008

Published in: Combinatorial Pattern Matching (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73437-6_34

Mathematics Subject Classification ID

Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items (6)

Efficient computation of substring equivalence classes with suffix arrays ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Fast, practical algorithms for computing all the repeats in a string ⋮ Alphabet-independent algorithms for finding context-sensitive repeats in linear time ⋮ Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression ⋮ Computing regularities in strings: a survey

This page was built for publication: Efficient Computation of Substring Equivalence Classes with Suffix Arrays