Towards a theory of patches

A. Amihood; Haim Parienty

Towards a theory of patches

A. Amihood, Haim Parienty

Department of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

Abstract

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.

Original language	American English
Title of host publication	International Symposium on String Processing and Information Retrieval
Editors	Jussi Karlgren, Jorma Tarhio, Heikki Hyyrö
Publisher	Springer Berlin Heidelberg
State	Published - 2009

Bibliographical note

Place of conference:Saariselkä, Finland

Cite this

@inproceedings{50d721c7a37f47dcaabdfe5c91e1efbf,

title = "Towards a theory of patches",

abstract = "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.",

author = "A. Amihood and Haim Parienty",

note = "Place of conference:Saariselk{\"a}, Finland",

year = "2009",

language = "American English",

editor = "Jussi Karlgren and Jorma Tarhio and Heikki Hyyr{\"o}",

booktitle = "International Symposium on String Processing and Information Retrieval",

publisher = "Springer Berlin Heidelberg",

}

TY - GEN

T1 - Towards a theory of patches

AU - Amihood, A.

AU - Parienty, Haim

N1 - Place of conference:Saariselkä, Finland

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 - https://scholar.google.co.il/scholar?q=Towards+a+Theory+of+Patches&btnG=&hl=en&as_sdt=0%2C5

M3 - Conference contribution

BT - International Symposium on String Processing and Information Retrieval

A2 - Karlgren, Jussi

A2 - Tarhio, Jorma

A2 - Hyyrö, Heikki

PB - Springer Berlin Heidelberg

ER -

Towards a theory of patches

Abstract

Bibliographical note

Other files and links

Fingerprint

Cite this