Multiple matching of parameterized patterns
نویسندگان
چکیده
منابع مشابه
Parameterized Matching
Two equal length strings s and s, over alphabets Σs and Σs′ , parameterize match if there exists a bijection π : Σs → Σs′ , such that π(s) = s, where π(s) is the renaming of each character of s via π. 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 maintenanc...
متن کاملParameterized Pattern Matching - Succinctly
The fields of succinct data structures and compressed text indexing have seen quite a bit of progress over the last 15 years. An important achievement, primarily using techniques based on the Burrows-Wheeler Transform (BWT), was obtaining the full functionality of suffix tree in the optimal number of bits. A crucial property that allows the use of BWT for designing compressed indexes is order-p...
متن کاملEfficient parameterized string matching
In parameterized string matching the pattern P matches a substring t of the text T if there exist a bijective mapping from the symbols of P to the symbols of t . We give simple and practical algorithms for finding all such pattern occurrences in sublinear time on average. The algorithms work for a single and multiple patterns. © 2006 Elsevier B.V. All rights reserved.
متن کاملParameterized matching with mismatches
The problem of approximate parameterized string searching consists of finding, for a given text t = t1t2 . . . tn and pattern p = p1p2 . . . pm over respective alphabets Σt and Σp , the injection πi from Σp to Σt maximizing the number of matches between πi(p) and ti ti+1 . . . ti+m−1 (i = 1,2, . . . , n −m + 1). We examine the special case where both strings are run-length encoded, and further ...
متن کاملHoming by Parameterized Scene Matching
In visual homing tasks, animals as well as robots can compute their movements from the current view and a snapshot taken at a home position. Solving this problem exactly would require knowledge about the distances to visible landmarks, information , which is not directly available to passive vision systems. We propose a homing scheme that dispenses with accurate distance information by using pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1996
ISSN: 0304-3975
DOI: 10.1016/0304-3975(94)00270-3