Recent years have witnessed a dramatic increase of interest in sophisticated string matching
problems, especially in information retrieval and computational biology. This book presents …

Over the years coding theory and complexity theory have benefited from a n-tuber of
mutually enriching connections. This article focuses on a new connection that has emerged …

Scaled and permuted string matching Page 1 Information Processing Letters 92 (2004) 293–297
www.elsevier.com/locate/ipl Scaled and permuted string matching Ayelet Butmana, Revital …

We give fast filtering algorithms to search for a 2-dimensional pattern in a 2-dimensional text
allowing any rotation of the pattern. We consider the cases of exact and approximate …

The most efficient currently known algorithms for two-dimensional pattern matching with
rotations have a worst case time complexity of O (n2m3), where the size of the text is n× n …

The problem of pattern matching with rotation is that of finding all occurrences of a two-
dimensional pattern in a text, in all possible rotations. We prove an upper and lower bound …

Scaled matching refers to the problem of finding all locations in the text where the pattern,
proportionally enlarged according to an arbitrary integral scale, appears. Scaled matching is …

We consider the template matching problem, in which one wants to find all good enough
occurrences of a pattern template P from a larger image I. The current standard of template …

We address the problem of searching for a two-dimensional pattern in a two-dimensional
text (or image), such that the pattern can be found even if it appears rotated and it is brighter …

The problem of image matching is to find for two given digital images A and B an admissible
transformation that converts image A as close as possible to B. This problem becomes hard …