6533b7d7fe1ef96bd126848b

RESEARCH PRODUCT

"Indexing structures for approximate string matching

Alessandra GabrieleAntonio RestivoMarinella SciortinoFilippo Mignosi

subject

CombinatoricsCombinatorics on wordsPattern recognition (psychology)Search engine indexingAutomata theoryHamming distanceString searching algorithmApproximate string matchingTime complexityMathematics

description

In this paper we give the first, to our knowledge, structures and corresponding algorithms for approximate indexing, by considering the Hamming distance, having the following properties. i) Their size is linear times a polylog of the size of the text on average. ii) For each pattern x, the time spent by our algorithms for finding the list occ(x) of all occurrences of a pattern x in the text, up to a certain distance, is proportional on average to |x| + |occ(x)|, under an additional but realistic hypothesis.

yearjournalcountryeditionlanguage
2003-01-01
10.1007/3-540-44849-7_20http://hdl.handle.net/11697/26692