MATCHING PATTERNS IN STRINGS SUBJECT TO MULTI-LINEAR TRANSFORMATIONS (extended abstract)
Tali Eilam, Uzi Vishkin · 1990
SUppOBe we are given two Btringa of real numbers. The longer string is called tat and the other is called pattern. We consider problems within the following framework. SUPPOBe each symbol of the pattern was modified by any transformation which is a member in some family of transformations. Find all occurrences 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.