Document Open Access Logo

Pattern matching with don't cares and few errors

Authors Raphael Clifford, Klim Efremo, Ely Porat, Amir Rotschild

PDF

File

Thumbnail PDF
PDF
DagSemProc.09281.5.pdf
  • Filesize: 276 kB
  • 19 pages

Document Identifiers

Subject Classification

Keywords
  • Prime Numbers
  • Group Testing
  • Streaming
  • Pattern Matching

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

Abstract

We present solutions for the k-mismatch pattern matching problem
with don't cares. Given a text t of length n and a pattern p of length m
with don't care symbols and a bound k, our algorithms find all the places
that the pattern matches the text with at most k mismatches. We first
give an \Theta(n(k + logmlog k) log n) time randomised algorithm which finds
the correct answer with high probability. We then present a new deter-
ministic \Theta(nk^2 log^m)time solution that uses tools originally developed
for group testing. Taking our derandomisation approach further we de-
velop an approach based on k-selectors that runs in \Theta(nk polylogm) time.
Further, in each case the location of the mismatches at each alignment is
also given at no extra cost.

Cite As Get BibTex

Raphael Clifford, Klim Efremo, Ely Porat, and Amir Rotschild. Pattern matching with don't cares and few errors. In Search Methodologies. Dagstuhl Seminar Proceedings, Volume 9281, pp. 1-19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2009) https://doi.org/10.4230/DagSemProc.09281.5

Author Details

Raphael Clifford
Klim Efremo
Ely Porat
Amir Rotschild
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact