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 (38)
Grammar compressed sequences with rank/select support ⋮ Approximate string matching with compressed indexes ⋮ A simple storage scheme for strings achieving entropy bounds ⋮ Compact Indexes for Flexible Top-$$k$$ Retrieval ⋮ Colored range queries and document retrieval ⋮ On compressing and indexing repetitive sequences ⋮ Faster repetition-aware compressed suffix trees based on block trees ⋮ On compressing permutations and adaptive sorting ⋮ Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets ⋮ Ultra-succinct representation of ordered trees with applications ⋮ Stronger Lempel-Ziv based compressed text indexing ⋮ On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation ⋮ Using compressed suffix-arrays for a compact representation of temporal-graphs ⋮ Speeding up the detection of tandem repeats over the edit distance ⋮ Succinct data structures for flexible text retrieval systems ⋮ Textual data compression in computational biology: algorithmic techniques ⋮ A framework for designing space-efficient dictionaries for parameterized and order-preserving matching ⋮ Efficient fully-compressed sequence representations ⋮ Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space ⋮ Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails ⋮ Practical compressed suffix trees ⋮ Algorithms for Indexing Highly Similar DNA Sequences ⋮ Rank and select revisited and extended ⋮ Fast compressed self-indexes with deterministic linear-time construction ⋮ Self-indexing Based on LZ77 ⋮ A quick tour on suffix arrays and compressed suffix arrays ⋮ Space-efficient construction of Lempel-Ziv compressed text indexes ⋮ Distribution-aware compressed full-text indexes ⋮ Lempel-Ziv compressed structures for document retrieval ⋮ Opportunistic data structures for range queries ⋮ Wee LCP ⋮ Dynamic rank/select structures with applications to run-length encoded texts ⋮ The exact multiple pattern matching problem solved by a reference tree approach ⋮ Permuted Longest-Common-Prefix Array ⋮ Locally Compressed Suffix Arrays ⋮ General Document Retrieval in Compact Space ⋮ Faster entropy-bounded compressed suffix trees ⋮ Improved and extended locating functionality on compressed suffix arrays
This page was built for publication: New text indexing functionalities of the compressed suffix arrays
