Abstract
We address the problems of pattern matching and approximate pattern matching in the sketching model. We show that it is impossible to compress the text into a small sketch and use only the sketch to decide whether a given pattern occurs in the text. We also prove a sketch size lower bound for approximate pattern matching, and show it is tight up to a logarithmic factor. © Springer-Verlag 2004.
Cite
CITATION STYLE
Bar-Yossef, Z., Jayram, T. S., Krauthgamer, R., & Kumar, R. (2004). The sketching complexity of pattern matching. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3122, 261–272. https://doi.org/10.1007/978-3-540-27821-4_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
