@inproceedings{7e6005bb21134f86b737cd14177547c6,
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 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 O(nm1/3k1/3 log2/3 m) time. The location of the mismatches at each alignment is also given at no extra cost.",
author = "Rapha{\"e}l Clifford and Ely Porat",
year = "2007",
doi = "10.1007/978-3-540-75530-2_12",
language = "אנגלית",
isbn = "9783540755296",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "130--136",
booktitle = "String Processing and Information Retrieval - 14th International Symposium, SPIRE 2007, Proceedings",
address = "גרמניה",
note = "14th International Symposium on String Processing and Information Retrieval, SPIRE 2007 ; Conference date: 29-10-2007 Through 31-10-2007",
}