New text indexing functionalities of the compressed suffix arrays
From MaRDI portal
Publication:4458882
Recommendations
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- scientific article; zbMATH DE number 6469201
- Indexing compressed text
- When indexing equals compression, experiments with compressing suffix arrays and applications
Cited in
(57)- On compressing permutations and adaptive sorting
- Speeding up the detection of tandem repeats over the edit distance
- Fast compressed self-indexes with deterministic linear-time construction
- scientific article; zbMATH DE number 6469201 (Why is no real title available?)
- Colored range queries and document retrieval
- Ultra-succinct representation of ordered trees with applications
- A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
- Practical compressed suffix trees
- Space-efficient construction of Lempel-Ziv compressed text indexes
- A quick tour on suffix arrays and compressed suffix arrays
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Faster entropy-bounded compressed suffix trees
- Compact indexes for flexible top-\(k\)
- Algorithms and Computation
- Combinatorial Pattern Matching
- Grammar compressed sequences with rank/select support
- Efficient fully-compressed sequence representations
- Improved and extended locating functionality on compressed suffix arrays
- Faster repetition-aware compressed suffix trees based on block trees
- A simple storage scheme for strings achieving entropy bounds
- Self-indexing based on LZ77
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- Accessing the suffix array via \(\phi^{-1}\)-forest
- Algorithms for indexing highly similar DNA sequences
- ESP-index: a compressed index based on edit-sensitive parsing
- On compressing and indexing repetitive sequences
- Algorithms and Computation
- Reverse-safe data structures for text indexing
- Permuted Longest-Common-Prefix Array
- Succinct data structures for flexible text retrieval systems
- Dynamic rank/select structures with applications to run-length encoded texts
- Relative Lempel-Ziv Compression of Suffix Arrays
- Rank and select revisited and extended
- Locally compressed suffix arrays
- Wee LCP
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- The exact multiple pattern matching problem solved by a reference tree approach
- Reverse-safe text indexing
- Textual data compression in computational biology: algorithmic techniques
- Stronger Lempel-Ziv based compressed text indexing
- Lempel-Ziv compressed structures for document retrieval
- Combinatorial Pattern Matching
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Approximate string matching with compressed indexes
- Alphabet-independent linear-time construction of compressed suffix arrays using \(o(n \log n)\)-bit working space
- Faster repetition-aware compressed suffix trees based on block trees
- Distribution-aware compressed full-text indexes
- General document retrieval in compact space
- Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
- On the possible patterns of inputs for block sorting in the Burrows-Wheeler transformation
- Indexing compressed text
- A Compressed Enhanced Suffix Array Supporting Fast String Matching
- scientific article; zbMATH DE number 2080264 (Why is no real title available?)
- Hybrid indexing revisited
- Opportunistic data structures for range queries
- Using compressed suffix-arrays for a compact representation of temporal-graphs
- scientific article; zbMATH DE number 1615289 (Why is no real title available?)
This page was built for publication: New text indexing functionalities of the compressed suffix arrays
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4458882)
