scientific article; zbMATH DE number 7378383
From MaRDI portal
Publication:5005170
DOI10.4230/LIPIcs.MFCS.2018.66MaRDI QIDQ5005170
Paweł Gawrychowski, Tatiana Starikovskaya, Gad M. Landau
Publication date: 4 August 2021
Full work available at URL: https://arxiv.org/abs/1806.09646
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Front Matter, Table of Contents, Preface, Conference Organization ⋮ Streaming dictionary matching with mismatches
Cites Work
- Improved bounds for dictionary look-up with one error
- A simple storage scheme for strings achieving entropy bounds
- Improved approximate string matching using compressed suffix data structures
- Surpassing the information theoretic bound with fusion trees
- Faster compressed dictionary matching
- Packed Compact Tries: A Fast and Efficient Data Structure for Online String Processing
- Compressed String Dictionary Look-Up with Edit Distance One
- Weighted Ancestors in Suffix Trees
- Optimal Data-Dependent Hashing for Approximate Near Neighbors
- Fast String Dictionary Lookup with One Error
- Alphabet-Dependent String Searching with Wexponential Search Trees
- Dynamic text and static pattern matching
- An analysis of the Burrows—Wheeler transform
- Fast Algorithms for Finding Nearest Common Ancestors
- Indexing compressed text
- Dictionary matching and indexing with errors and don't cares
- Faster and Space-Optimal Edit Distance “1” Dictionary
- Efficient randomized pattern-matching algorithms
- Uniform deterministic dictionaries
- Deterministic Indexing for Packed Strings
- Theoretical and Practical Improvements on the RMQ-Problem, with Applications to LCA and LCE
- A Linear Size Index for Approximate Pattern Matching
- Compressed indexes for approximate string matching
This page was built for publication:
