@inproceedings{f778c056749340348e4c65935ffa1117,

title = "From coding theory to efficient pattern matching",

abstract = "We consider the classic problem of pattern matching with few mismatches in the presence of promiscuously matching wildcard symbols. Given a text t of length n and a pattern p of length m with optional wildcard symbols and a bound k, our algorithm finds all the alignments for which the pattern matches the text with Hamming distance at most k and also returns the location and identity of each mismatch. The algorithm we present is deterministic and runs in {\~O}(kn) time, matching the best known randomised time complexity to within logarithmic factors. The solutions we develop borrow from the tool set of algebraic coding theory and provide a new framework in which to tackle approximate pattern matching problems.",

author = "Rapha{\"e}l Clifford and Klim Efremenko and Ely Porat and Amir Rothschild",

year = "2009",

month = jan,

day = "1",

doi = "10.1137/1.9781611973068.85",

language = "English",

isbn = "9780898716801",

series = "Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms",

publisher = "Association for Computing Machinery (ACM)",

pages = "778--784",

booktitle = "Proceedings of the 20th Annual ACM-SIAM Symposium on Discrete Algorithms",

address = "United States",

note = "20th Annual ACM-SIAM Symposium on Discrete Algorithms ; Conference date: 04-01-2009 Through 06-01-2009",

}