TY - JOUR
T1 - Towards a theory of patches
AU - Amir, Amihood
AU - Paryenty, Haim
PY - 2012/4
Y1 - 2012/4
N2 - 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.
AB - 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.
KW - Multi-dimensional indexing
KW - Patches
KW - Tiling
UR - http://www.scopus.com/inward/record.url?scp=84858082761&partnerID=8YFLogxK
U2 - 10.1016/j.jda.2011.12.022
DO - 10.1016/j.jda.2011.12.022
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:84858082761
SN - 1570-8667
VL - 12
SP - 61
EP - 73
JO - Journal of Discrete Algorithms
JF - Journal of Discrete Algorithms
ER -