A new method for approximate indexing and dictionary lookup with one error
type: Item
instance of: scholarly article
title: A new method for approximate indexing and dictionary lookup with one error
zbMATH Open document ID: 1184.68211
author: Moritz G. Maaß
author: Johannes Nowak
published in: Information Processing Letters
publication date: 2009-12-18T00:00:00Z
Mathematics Subject Classification ID: 68P10
Mathematics Subject Classification ID: 68P05
Mathematics Subject Classification ID: 68W05
zbMATH DE Number: 5650153
zbMATH Keywords: algorithms
zbMATH Keywords: data structures
zbMATH Keywords: fault tolerance
zbMATH Keywords: information retrieval
MaRDI profile type: Publication
full work available at URL: j.ipl.2005.08.001
OpenAlex ID: W2044813797
cites work: Text Indexing and Dictionary Matching with One Error
cites work: Q2753929
cites work: Q3044326
cites work: Dictionary matching and indexing with errors and don't cares
cites work: Q4437504
cites work: Algorithms on Strings, Trees and Sequences
cites work: Combinatorial Pattern Matching
cites work: A sublinear algorithm for approximate keyword searching
cites work: Asymptotical growth of a class of random trees
cites work: Asymptotic properties of data compression and suffix trees
cites work: On-line construction of suffix trees
DOI: 10.1016/J.IPL.2005.08.001
description: scientific article; zbMATH DE number 5650153