Efficient Computation of Substring Equivalence Classes with Suffix Arrays

DOI10.1007/978-3-540-73437-6_34MaRDI QIDQ3506935zbMATH OpenOpenAlexFDO

Authors Kazuyuki Narisawa, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda

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

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

Recommendations

• Efficient computation of substring equivalence classes with suffix arrays
• Counting suffix arrays and strings
• Computing Longest Common Substrings Via Suffix Arrays
• Suffix Arrays: A New Method for On-Line String Searches
• Linear work suffix array construction

Cited in

(8)

• Computing regularities in strings: a survey
• Efficient computation of substring equivalence classes with suffix arrays
• Alphabet-independent algorithms for finding context-sensitive repeats in linear time
• Linear-size CDAWG: new repetition-aware indexing and grammar compression
• Efficient List-Based Computation of the String Subsequence Kernel
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Fast, practical algorithms for computing all the repeats in a string
• Counting suffix arrays and strings

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3506935)