New text indexing functionalities of the compressed suffix arrays

DOI10.1016/S0196-6774(03)00087-7zbMATH Open1100.68563MaRDI QIDQ4458882FDOQ4458882

Authors: Kunihiko Sadakane 

Publication date: 14 March 2004

Published in: Journal of Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

CompressionSuffix arrayText database

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Colored range queries and document retrieval
• Ultra-succinct representation of ordered trees with applications
• Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
• A framework for designing space-efficient dictionaries for parameterized and order-preserving matching
• Practical compressed suffix trees
• Algorithms and Computation
• Combinatorial Pattern Matching
• Compact indexes for flexible top-\(k\)
• Space-efficient construction of Lempel-Ziv compressed text indexes
• A quick tour on suffix arrays and compressed suffix arrays
• Faster entropy-bounded compressed suffix trees
• Grammar compressed sequences with rank/select support
• Efficient fully-compressed sequence representations
• Faster repetition-aware compressed suffix trees based on block trees
• Improved and extended locating functionality on compressed suffix arrays
• A simple storage scheme for strings achieving entropy bounds
• Accessing the suffix array via \(\phi^{-1}\)-forest
• Title not available (Why is that?)
• Self-indexing based on LZ77
• Algorithms for indexing highly similar DNA sequences
• ESP-index: a compressed index based on edit-sensitive parsing
• Algorithms and Computation
• Reverse-safe data structures for text indexing
• On compressing and indexing repetitive sequences
• Permuted Longest-Common-Prefix Array
• Relative Lempel-Ziv Compression of Suffix Arrays
• Succinct data structures for flexible text retrieval systems
• Dynamic rank/select structures with applications to run-length encoded texts
• 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)
• Reverse-safe text indexing
• The exact multiple pattern matching problem solved by a reference tree approach
• Textual data compression in computational biology: algorithmic techniques
• Stronger Lempel-Ziv based compressed text indexing
• Combinatorial Pattern Matching
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
• Lempel-Ziv compressed structures for document retrieval
• 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
• Linear-time computation of DAWGs, symmetric indexing structures, and MAWs for integer alphabets
• Distribution-aware compressed full-text indexes
• General document retrieval in compact space
• 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
• Title not available (Why is that?)
• Hybrid indexing revisited
• Opportunistic data structures for range queries
• Using compressed suffix-arrays for a compact representation of temporal-graphs
• Title not available (Why is that?)

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)