Dictionary matching and indexing with errors and don't cares

Richard Cole, Lee Ad Gottlieb, Moshe Lewenstein

Research output: Contribution to journalConference article

Abstract

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 + (c1 log n)k/k! + # matches), with a data structure of size O(n (c2 log n)k/k!) and a preprocessing time of O(n(c2 log n)k/k!), where c1, C 2 > 1 are constants. The deterministic preprocessing assumes a weakly nonuniform RAM model; this assumption is not needed if randomization is used in the preprocessing.

Original languageEnglish (US)
Pages (from-to)91-100
Number of pages10
JournalConference Proceedings of the Annual ACM Symposium on Theory of Computing
DOIs
StatePublished - 2004
EventProceedings of the 36th Annual ACM Symposium on Theory of Computing - Chicago, IL, United States
Duration: Jun 13 2004Jun 15 2004

Keywords

  • Approximate pattern matching
  • Dictionary matching
  • Dictionary query
  • Suffix trees
  • Text indexing
  • Wild-cards

ASJC Scopus subject areas

  • Software

Fingerprint Dive into the research topics of 'Dictionary matching and indexing with errors and don't cares'. Together they form a unique fingerprint.

  • Cite this