Article thumbnail


By Carmit Hazay


I would like to thank my advisor Moshe Lewenstein for his guidance and directions. He taught me a lot and I am grateful for the time and effort he put in this work. Also, special thanks to Dina Sokol and Dekel Tzur. It was very inspiring working with them. Abstract Two equal length strings s and s0, over alphabets \Sigma s and \Sigma s0, parameterize match if there exists a bijection ij: \Sigma s! \Sigma s0, such that ij(s) = s0, where ij(s) is the renaming of each character of s via ij. Parameterized matching is the problem of finding all parameterized matches of a pattern string p in a text t. It was introduced as a model for software duplication detection in software maintenance systems and also has applications in image processing and computational biology. Two dimensional parameterized matching is the task of finding all locations in an n * n-length text where the m * m subtext beginning at that location and a given m * m-length pattern p-match. This models searching for color images with changing color maps. Our first result is an algorithm for the two dimensional case that runs in time O(n2 + m2.5 * polylog(m)). Approximate parameterized matching is the problem of finding, at each location, a bijection ij that maximizes the number of characters that are mapped from p to the appropriate |p|-length substring of t. We consider the problem for which an error threshold, k, is given and the goal is to find all locations in t for which there exists a bijection ij which maps p into the appropriate |p|-length substring of t with at most k mismatched mapped-elements

Year: 2004
OAI identifier: oai:CiteSeerX.psu:
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • (external link)
  • (external link)
  • Suggested articles

    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.