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 -