Matching patterns in strings subject to multi-linear transformations

Suppose we are given two strings of real numbers. The longer string is called text and the other is called pattern. We consider problems within the following framework. Suppose each symbol of the pattern was modified by any transformation which is a member in some family of transformations. Find all occurences of the pattern in the text where the pattern may appear subject to any one of these transformations. Problems are introduced and efficient algorithms are given.

Authors

• Tali Eilam-Tzoreff
• Uzi Vishkin

Keywords

No keywords are indexed for this paper.