Text indexing with errors
From MaRDI portal
Publication:925060
DOI10.1016/j.jda.2006.11.001zbMath1158.68382OpenAlexW2065562996MaRDI QIDQ925060
Johannes Nowak, Moritz G. Maaß
Publication date: 29 May 2008
Published in: Journal of Discrete Algorithms (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jda.2006.11.001
Analysis of algorithms (68W40) Nonnumerical algorithms (68W05) Data structures (68P05) Information storage and retrieval of data (68P20)
Related Items
Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds ⋮ Indexing factors with gaps ⋮ Lossless Seeds for Searching Short Patterns with High Error Rates ⋮ A linear size index for approximate pattern matching ⋮ String indexing for patterns with wildcards
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Improved bounds for dictionary look-up with one error
- A new method for approximate indexing and dictionary lookup with one error
- Asymptotical growth of a class of random trees
- Sublinear approximate string matching and biological applications
- A sublinear algorithm for approximate keyword searching
- On-line construction of suffix trees
- Lower bounds for high dimensional nearest neighbor search and related problems
- Suffix Arrays: A New Method for On-Line String Searches
- Tighter bounds for nearest neighbor search and related problems in the cell probe model
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Linear-Time Construction of Suffix Arrays
- Space Efficient Linear Time Construction of Suffix Arrays
- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
- Dictionary matching and indexing with errors and don't cares
- Algorithms for approximate string matching
- Self-alignments in words and their applications
- A Space-Economical Suffix Tree Construction Algorithm
- Algorithms on Strings, Trees and Sequences
- Asymptotic properties of data compression and suffix trees
- Dictionary Look-Up with One Error
- Text Indexing and Dictionary Matching with One Error
- Error Detecting and Error Correcting Codes
- Combinatorial Pattern Matching
