Approximate string matching with compressed indexes
DOI10.3390/A2031105zbMATH Open1461.68271OpenAlexW2121806125WikidataQ58883988 ScholiaQ58883988MaRDI QIDQ1662494FDOQ1662494
Authors: Luís M. S. Russo, Gonzalo Navarro, Arlindo L. Oliveira, Pedro Morales-Almazán 
Publication date: 20 August 2018
Published in: Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.3390/a2031105
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
approximate string matchingcompressed suffix treecompressed indexLempel-Ziv indexcompressed suffix array
Data structures (68P05) Approximation algorithms (68W25) Coding and information theory (compaction, compression, models of communication, encoding schemes, etc.) (aspects in computer science) (68P30) Algorithms on strings (68W32)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Compressed representations of sequences and full-text indexes
- An analysis of the Burrows-Wheeler transform
- Indexing compressed text
- Dictionary matching and indexing with errors and don't cares
- Title not available (Why is that?)
- Compression of individual sequences via variable-rate coding
- Succinct Indexable Dictionaries with Applications to Encoding $k$-ary Trees, Prefix Sums and Multisets
- Compressed text indexes, from theory to practice
- Fully-Compressed Suffix Trees
- Compressed Suffix Arrays and Suffix Trees with Applications to Text Indexing and String Matching
- Compressed suffix trees with full functionality
- On the Complexity of Finite Sequences
- A universal algorithm for sequential data compression
- Suffix Arrays: A New Method for On-Line String Searches
- Very fast and simple approximate string matching
- Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
- Incremental String Comparison
- Title not available (Why is that?)
- Dynamic entropy-compressed sequences and full-text indexes
- Algorithms and Computation
- Improving an algorithm for approximate pattern matching
- A fast bit-vector algorithm for approximate string matching based on dynamic programming
- Finding approximate patterns in strings
- Average-optimal single and multiple approximate string matching
- New text indexing functionalities of the compressed suffix arrays
- Reducing the Space Requirement of LZ-Index
- Implementing the LZ-index, theory versus practice
- Indexing text using the Ziv--Lempel trie
- Linear bidirectional on-line construction of affix trees
- Title not available (Why is that?)
- Combinatorial Pattern Matching
- A Linear Size Index for Approximate Pattern Matching
- Combinatorial Pattern Matching
- An(other) Entropy-Bounded Compressed Suffix Tree
- A sublinear algorithm for approximate keyword searching
- Indexing text with approximate \(q\)-grams
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
- Lossless seeds for searching short patterns with high error rates
- Simple, compact and robust approximate string dictionary
- Title not available (Why is that?)
- Binary jumbled string matching for highly run-length compressible texts
- Efficient fully-compressed sequence representations
- Summarized bit batch-based triangle listing in massive graphs
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- Approximate string matching using a bidirectional index
- FM-index of alignment: a compressed index for similar strings
- Indexed multi-pattern matching
- Compressed text indexes, from theory to practice
- Cache-Oblivious Index for Approximate String Matching
- Approximate matching of run-length compressed strings
- Title not available (Why is that?)
- Fast relative Lempel-Ziv self-index for similar sequences
- Hybrid indexes for repetitive datasets
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)
