Towards a theory of patches

Citations of this article
Mendeley users who have this article in their library.


Many applications have a need for indexing unstructured data. It turns out that a similar ad-hoc method is being used in many of them - that of considering small particles of the data. In this paper we formalize this concept as a tiling problem and consider the efficiency of dealing with this model in the pattern matching setting. We present an efficient algorithm for the one-dimensional tiling problem, and the one-dimensional tiled pattern matching problem. We prove the two-dimensional problem is hard and then develop an approximation algorithm with an approximation ratio converging to 2. We show that other two-dimensional versions of the problem are also hard, regardless of the number of neighbors a tile has. © 2011 Elsevier B.V. All rights reserved.




Amir, A., & Paryenty, H. (2012). Towards a theory of patches. Journal of Discrete Algorithms, 12, 61–73.

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free