A new method for approximate indexing and dictionary lookup with one error

DOI10.1016/j.ipl.2005.08.001zbMath1184.68211OpenAlexW2044813797MaRDI QIDQ1044734

Moritz G. Maaß, Johannes Nowak

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.08.001

zbMATH Keywords

algorithmsinformation retrievaldata structuresfault tolerance

Mathematics Subject Classification ID

Searching and sorting (68P10) Nonnumerical algorithms (68W05) Data structures (68P05)

Related Items

A metric index for approximate string matching ⋮ From Nerode's congruence to suffix automata with mismatches ⋮ On the Suffix Automaton with Mismatches ⋮ Text indexing with errors ⋮ Maximal intersection queries in randomized input models

Cites Work

• Asymptotical growth of a class of random trees
• A sublinear algorithm for approximate keyword searching
• On-line construction of suffix trees
• Dictionary matching and indexing with errors and don't cares
• Algorithms on Strings, Trees and Sequences
• Asymptotic properties of data compression and suffix trees
• Text Indexing and Dictionary Matching with One Error
• Combinatorial Pattern Matching
• Unnamed Item
• Unnamed Item
• Unnamed Item