Can I read Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Dictionary matching and indexing with errors and don't cares on EtoBox?

Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Dictionary matching and indexing with errors and don't cares by Cole, Richard; Gottlieb, Lee-Ad; Lewenstein, Moshe is a scholarly article available to read on EtoBox.

What is Proceedings of the thirty-sixth annual ACM symposium on Theory of computing - STOC '04 - Dictionary matching and indexing with errors and don't cares about?

This paper considers various flavors of the following online problem: preprocess a text or collection of strings, so that given a query string p, all matches of p with the text can be reported quickly. In this paper we consider matches in which a bounded number of mismatches are allowed, or in which a bounded number of "don't care" characters are allowed. The specific problems we look at are: indexing, in which there is a single text t, and we seek locations where p matches a substring of t; dictionary queries, in which a collection of strings is given upfront, and we seek those strings which match p in their entirety; and dictionary matching, in which a collection of strings is given upfront, and we seek those substrings of a (long) p which match an original string in its entirety. These are all instances of an all-to-all matching problem, for which we provide a single solution. The performance bounds all have a similar character. For example, for the indexing problem with n = |t| and m = |p|, the query time for k substitutions is O(m ), where c1, c2 > 1 are constants. The deterministic preprocessing assumes a weakly nonuniform RAM model; this assumption is not needed if randomiza

Author

Cole, Richard; Gottlieb, Lee-Ad; Lewenstein, Moshe

Publisher

ACM Press

Published

2004

Language

EN