A filtering algorithm for k-mismatch with don't cares

Raphaël Clifford; Ely Porat

doi:10.1016/j.ipl.2010.08.012

A filtering algorithm for k-mismatch with don't cares

Raphaël Clifford, Ely Porat

Department of Computer Science

University of Bristol

Research output: Contribution to journal › Article › peer-review

6 Scopus citations

Abstract

We present a filtering based algorithm 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 in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nm1/3k1/3log2/3m) time.

Original language	English
Pages (from-to)	1021-1025
Number of pages	5
Journal	Information Processing Letters
Volume	110
Issue number	22
DOIs	https://doi.org/10.1016/j.ipl.2010.08.012
State	Published - 31 Oct 2010

Keywords

Algorithms
Combinatorial problems
Design of algorithms
Don't cares
Fast Fourier transforms
Filtering
Pattern matching
String algorithms

Access to Document

10.1016/j.ipl.2010.08.012

Cite this

@article{2af06e3b922c4d35972292c6567c5bbe,

title = "A filtering algorithm for k-mismatch with don't cares",

abstract = "We present a filtering based algorithm 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 in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nm1/3k1/3log2/3m) time.",

keywords = "Algorithms, Combinatorial problems, Design of algorithms, Don't cares, Fast Fourier transforms, Filtering, Pattern matching, String algorithms",

author = "Rapha{\"e}l Clifford and Ely Porat",

year = "2010",

month = oct,

day = "31",

doi = "10.1016/j.ipl.2010.08.012",

language = "אנגלית",

volume = "110",

pages = "1021--1025",

journal = "Information Processing Letters",

issn = "0020-0190",

publisher = "Elsevier B.V.",

number = "22",

}

TY - JOUR

T1 - A filtering algorithm for k-mismatch with don't cares

AU - Clifford, Raphaël

AU - Porat, Ely

PY - 2010/10/31

Y1 - 2010/10/31

N2 - We present a filtering based algorithm 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 in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nm1/3k1/3log2/3m) time.

AB - We present a filtering based algorithm 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 in either p or t (but not both), and a bound k, our algorithm finds all the places that the pattern matches the text with at most k mismatches. The algorithm is deterministic and runs in Θ(nm1/3k1/3log2/3m) time.

KW - Algorithms

KW - Combinatorial problems

KW - Design of algorithms

KW - Don't cares

KW - Fast Fourier transforms

KW - Filtering

KW - Pattern matching

KW - String algorithms

UR - http://www.scopus.com/inward/record.url?scp=77957135631&partnerID=8YFLogxK

U2 - 10.1016/j.ipl.2010.08.012

DO - 10.1016/j.ipl.2010.08.012

M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???

AN - SCOPUS:77957135631

SN - 0020-0190

VL - 110

SP - 1021

EP - 1025

JO - Information Processing Letters

JF - Information Processing Letters

IS - 22

ER -

A filtering algorithm for k-mismatch with don't cares

Abstract

Keywords

Access to Document

Other files and links

Fingerprint

Cite this