Pattern matching with don't cares and few errors

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 a Θ...

Full description

Saved in:

Bibliographic Details
Published in:	Journal of computer and system sciences Vol. 76; no. 2; pp. 115 - 124
Main Authors:	Clifford, Raphaël, Efremenko, Klim, Porat, Ely, Rothschild, Amir
Format:	Journal Article
Language:	English
Published:	Elsevier Inc 01.03.2010
Subjects:	Algorithms Alignment Errors Group testing Matching Mathematical models Pattern matching Position (location) Randomised algorithms String algorithms Symbols Texts Randomised algorithms String algorithms Group testing Pattern matching
ISSN:	0022-0000, 1090-2724
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!