The Sketching Complexity of Pattern Matching

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.

• Type: Conference
• Year: 2004
• Where: APPROX
• Authors: Ziv Bar-Yossef, T. S. Jayram, Robert Krauthgamer, Ravi Kumar
• Keywords: Algorithms, APPROX 2004, Approximate Pattern Matching, Pattern Matching, Size Lower Bound