@inproceedings{66e76620ff6d4c9fa4cb60c45248243d,

title = "Mismatch Sampling",

abstract = "We consider the well known problem of pattern matching under the Hamming distance. Previous approaches have shown how to count the number of mismatches efficiently, especially when a bound is known for the maximum Hamming distance. Our interest is different in that we wish collect a random sample of mismatches of fixed size at each position in the text. Given a pattern p of length m and a text t of length n, we show how to sample with high probability c mismatches where possible from every alignment of p and t in O((cthinspace+thinspacelogn)(nthinspace+thinspacemlogm)logm) time. Further, we guarantee that the mismatches are sampled uniformly and can therefore be seen as representative of the types of mismatches that occur.",

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

note = "Funding Information: This work was supported in part by the Binational Science Foundation (BSF) grant 2006334 and Israel Science Foundation (ISF) grant 1484/08 as well as the Engineering and Physical Sciences Research Council (EPSRC).; 15th International Symposium on String Processing and Information Retrieval, SPIRE 2008 ; Conference date: 10-11-2008 Through 12-11-2008",

year = "2009",

doi = "10.1007/978-3-540-89097-3_11",

language = "אנגלית",

isbn = "978-3-540-89097-3",

series = "Lecture Notes in Computer Science",

publisher = "Springer",

pages = "99--108",

editor = "Amihood Amir and Andrew Turpin and Alistair Moffat",

booktitle = "String Processing and Information Retrieval",

address = "גרמניה",

}