New text indexing functionalities of the compressed suffix arrays
From MaRDI portal
Publication:4458882
DOI10.1016/S0196-6774(03)00087-7zbMath1100.68563MaRDI QIDQ4458882
Publication date: 14 March 2004
Published in: Journal of Algorithms (Search for Journal in Brave)
Related Items
Colored range queries and document retrieval, On compressing and indexing repetitive sequences, On compressing permutations and adaptive sorting, Ultra-succinct representation of ordered trees with applications, Textual data compression in computational biology: algorithmic techniques, Efficient fully-compressed sequence representations, A quick tour on suffix arrays and compressed suffix arrays, Space-efficient construction of Lempel-Ziv compressed text indexes, Dynamic rank/select structures with applications to run-length encoded texts, A simple storage scheme for strings achieving entropy bounds, Succinct data structures for flexible text retrieval systems, Wee LCP, Faster entropy-bounded compressed suffix trees, Approximate string matching with compressed indexes, On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation, Distribution-aware compressed full-text indexes, Improved and extended locating functionality on compressed suffix arrays, Grammar compressed sequences with rank/select support, Stronger Lempel-Ziv based compressed text indexing, Speeding up the detection of tandem repeats over the edit distance, Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space, Rank and select revisited and extended, Opportunistic data structures for range queries, Locally Compressed Suffix Arrays, General Document Retrieval in Compact Space, Compact Indexes for Flexible Top-$$k$$ Retrieval, Self-indexing Based on LZ77, Permuted Longest-Common-Prefix Array
