TY - GEN
T1 - Towards a theory of patches
AU - Amir, Amihood
AU - Parienty, Haim
PY - 2009
Y1 - 2009
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. We present an efficient algorithm for the one dimension tiling problem, and prove the two dimension problem is hard. We then develop an approximation algorithm with an approximation ratio converging to 2. We show that the "one-and-a-half" dimensional version of the problem is also hard.
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. We present an efficient algorithm for the one dimension tiling problem, and prove the two dimension problem is hard. We then develop an approximation algorithm with an approximation ratio converging to 2. We show that the "one-and-a-half" dimensional version of the problem is also hard.
UR - http://www.scopus.com/inward/record.url?scp=71049132268&partnerID=8YFLogxK
U2 - 10.1007/978-3-642-03784-9_25
DO - 10.1007/978-3-642-03784-9_25
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:71049132268
SN - 3642037836
SN - 9783642037832
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 254
EP - 265
BT - String Processing and Information Retrieval - 16th International Symposium, SPIRE 2009, Proceedings
T2 - 16th International Symposium on String Processing and Information Retrieval, SPIRE 2009
Y2 - 25 August 2009 through 27 August 2009
ER -