Approximate string matching with compressed indexes
From MaRDI portal
Recommendations
- Compressed Indexes for Approximate String Matching
- Compressed indexes for approximate string matching
- Approximate string matching using compressed suffix arrays
- Combinatorial Pattern Matching
- Improved approximate string matching using compressed suffix data structures
- Algorithms and Computation
- Approximate matching of run-length compressed strings
- scientific article; zbMATH DE number 1786446
- scientific article; zbMATH DE number 2011852
Cites work
- scientific article; zbMATH DE number 3913711 (Why is no real title available?)
- scientific article; zbMATH DE number 2079421 (Why is no real title available?)
- scientific article; zbMATH DE number 2149348 (Why is no real title available?)
- A Linear Size Index for Approximate Pattern Matching
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- A sublinear algorithm for approximate keyword searching
- A universal algorithm for sequential data compression
- Algorithms and Computation
- Algorithms on Strings, Trees and Sequences
- An analysis of the Burrows-Wheeler transform
- An(other) Entropy-Bounded Compressed Suffix Tree
- Average-optimal single and multiple approximate string matching
- Combinatorial Pattern Matching
- Combinatorial Pattern Matching
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed representations of sequences and full-text indexes
- Compressed suffix trees with full functionality
- Compressed text indexes, from theory to practice
- Compression of individual sequences via variable-rate coding
- Dictionary matching and indexing with errors and don't cares
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Dynamic entropy-compressed sequences and full-text indexes
- Finding approximate patterns in strings
- Fully-Compressed Suffix Trees
- Implementing the LZ-index, theory versus practice
- Improving an algorithm for approximate pattern matching
- Incremental String Comparison
- Indexing compressed text
- Indexing text using the Ziv--Lempel trie
- Indexing text with approximate \(q\)-grams
- Linear bidirectional on-line construction of affix trees
- New text indexing functionalities of the compressed suffix arrays
- On the Complexity of Finite Sequences
- Reducing the Space Requirement of LZ-Index
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Suffix Arrays: A New Method for On-Line String Searches
- Very fast and simple approximate string matching
Cited in
(19)- Approximate String Matching Using a Bidirectional Index
- On compressing permutations and adaptive sorting
- Fast relative Lempel-Ziv self-index for similar sequences
- Fast relative Lempel-Ziv self-index for similar sequences
- Simple, compact and robust approximate string dictionary
- Approximate matching of run-length compressed strings
- Compressed text indexes, from theory to practice
- Summarized bit batch-based triangle listing in massive graphs
- Hybrid indexes for repetitive datasets
- scientific article; zbMATH DE number 7559178 (Why is no real title available?)
- scientific article; zbMATH DE number 1786446 (Why is no real title available?)
- Indexed multi-pattern matching
- Efficient fully-compressed sequence representations
- Lossless seeds for searching short patterns with high error rates
- Cache-Oblivious Index for Approximate String Matching
- Approximate string matching using a bidirectional index
- FM-index of alignment: a compressed index for similar strings
- Binary jumbled string matching for highly run-length compressible texts
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
This page was built for publication: Approximate string matching with compressed indexes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1662494)
