Linear Time Suffix Array Construction Using D-Critical Substrings
From MaRDI portal
Publication:3637104
DOI10.1007/978-3-642-02441-2_6zbMath1247.68071MaRDI QIDQ3637104
Wai Hong Chan, Ge Nong, Sen Zhang
Publication date: 7 July 2009
Published in: Combinatorial Pattern Matching (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02441-2_6
Related Items
Lightweight algorithms for constructing and inverting the BWT of string collections, Efficient algorithms for three variants of the LPF table, The longest common extension problem revisited and applications to approximate string searching, Computing regularities in strings: a survey, Computing the longest previous factor, On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation, Lightweight BWT Construction for Very Large String Collections
Cites Work
- Unnamed Item
- Unnamed Item
- Engineering a lightweight suffix array construction algorithm
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Optimal Lightweight Construction of Suffix Arrays for Constant Alphabets