Text indexing with errors
From MaRDI portal
Publication:925060
DOI10.1016/J.JDA.2006.11.001zbMATH Open1158.68382OpenAlexW2065562996MaRDI QIDQ925060FDOQ925060
Authors: Moritz G. Maaß, Johannes Nowak 
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
Recommendations
Information storage and retrieval of data (68P20) Analysis of algorithms (68W40) Data structures (68P05) Nonnumerical algorithms (68W05)
Cites Work
- Algorithms on Strings, Trees and Sequences
- Error detecting and error correcting codes
- Dictionary matching and indexing with errors and don't cares
- Title not available (Why is that?)
- Title not available (Why is that?)
- Improved bounds for dictionary look-up with one error
- Dictionary Look-Up with One Error
- Text Indexing and Dictionary Matching with One Error
- Suffix Arrays: A New Method for On-Line String Searches
- A Space-Economical Suffix Tree Construction Algorithm
- On-line construction of suffix trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Space efficient linear time construction of suffix arrays
- Algorithms for approximate string matching
- Compressed suffix arrays and suffix trees with applications to text indexing and string matching (extended abstract)
- Sublinear approximate string matching and biological applications
- Title not available (Why is that?)
- Linear-time construction of suffix arrays (extended abstract)
- Self-alignments in words and their applications
- Lower bounds for high dimensional nearest neighbor search and related problems
- Tighter bounds for nearest neighbor search and related problems in the cell probe model
- Combinatorial Pattern Matching
- Title not available (Why is that?)
- Asymptotical growth of a class of random trees
- Asymptotic properties of data compression and suffix trees
- A new method for approximate indexing and dictionary lookup with one error
- A sublinear algorithm for approximate keyword searching
- A linear lower bound on index size for text retrieval
- Time-space tradeoffs, multiparty communication complexity, and nearest-neighbor problems
Cited In (6)
- Lossless seeds for searching short patterns with high error rates
- Approximate search of short patterns with high error rates using the \(01^\ast 0\) lossless seeds
- Combinatorial Pattern Matching
- Errata for ``Faster index for property matching
- Indexing factors with gaps
- A linear size index for approximate pattern matching
This page was built for publication: Text indexing with errors
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q925060)
