Efficient Computation of Substring Equivalence Classes with Suffix Arrays
From MaRDI portal
Publication:3506935
DOI10.1007/978-3-540-73437-6_34zbMath1138.68377MaRDI 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
Related Items
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression, Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets, Alphabet-independent algorithms for finding context-sensitive repeats in linear time, Fast, practical algorithms for computing all the repeats in a string, Computing regularities in strings: a survey, Efficient computation of substring equivalence classes with suffix arrays