We present a new data structure that allows to report all matches in worst-case time O ( | Σ | m + occ ) , which is linear in the pattern length m and the ...

We consider the problem of designing an efficient index for approximate pattern matching. Despite ongoing efforts, this topic is still a challenge in ...

We consider the problem of designing an efficient index for approximate pattern matching. Despite ongoing efforts, this topic is still a challenge in ...

A new method for approximate indexing and dictionary lookup with one error · Moritz G. MaaßJohannes Nowak. Computer Science. Inf. Process. Lett. 2005. 8 ...

Maaß, M.G., Nowak, J.: A new method for approximate indexing and dictionary lookup with one error. Information Processing Letters (IPL) (to be published).

In this paper we present a uniform deterministic solution to both the indexing and the general dictionary matching problem with one error. We preprocess the ...

Jul 25, 2015 · In this paper we present a uniform deterministic solution to both the indexing and the general dictionary matching problem with one error. We ...

This paper studies the 1-error dictionary search problem in external memory. The input is a set D of strings whose characters are drawn from a constant-size ...

Abstract. Approximate dictionary matching is a classic string match- ing problem (checking if a query string occurs in a collection of strings).

The primary goal of this paper is to survey state of the art indexing methods for approximate dictionary searching. To improve understanding of the field, ...