✦ LIBER ✦

Inverse Pattern Matching

✍ Scribed by Amihood Amir; Alberto Apostolico; Moshe Lewenstein

Publisher: Elsevier Science
Year: 1997
Tongue: English
Weight: 181 KB
Volume: 24
Category: Article
ISSN: 0196-6774
DOI: 10.1006/jagm.1996.0850

No coin nor oath required. For personal study only.

✦ Synopsis

Let a textstring T of n symbols from some alphabet ⌺ and an integer mn be given. A pattern P of length m over ⌺ is sought such that P minimizes Ž . alternatively, maximizes the total number of pairwise character mismatches generated when P is compared with all m-character substrings of T. Two additional variants of the problem are obtained by adding the constraint that P be Ž . respectively, not be a substring of T. Efficient sequential algorithms are proposed in this paper for the problem and its variants.

📜 SIMILAR VOLUMES

Pattern Matching with Swaps

✍ Amihood Amir; Yonatan Aumann; Gad M. Landau; Moshe Lewenstein; Noa Lewenstein 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 146 KB

Let a text string T of n symbols and a pattern string P of m symbols from alphabet be given. A swapped version T of T is a length n string derived from T by a series of local swaps (i.e., t ← t +1 and t +1 ← t ), where each element can participate in no more than one swap. The pattern matching with

Pattern Matching in Hypertext

✍ Amihood Amir; Moshe Lewenstein; Noa Lewenstein 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 142 KB

The importance of hypertext has been steadily growing over the past decade. The Internet and other information systems use hypertext format, with data organized associatively rather than sequentially or relationally. A myriad of textual problems have been considered in the pattern matching field wit

Fastest Pattern Matching in Strings

✍ L. Colussi 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 850 KB

An algorithm is presented that substantially improves the algorithm of Boyer and Moore for pattern matching in strings, both in the worst case and in the average. Both the Boyer and Moore algorithm and the new algorithm assume that the characters in the pattern and in the text are taken from a given

Pattern matching in historical data

✍ Michael C. Johannesmeyer; Ashish Singhal; Dale E. Seborg 📂 Article 📅 2002 🏛 American Institute of Chemical Engineers 🌐 English ⚖ 581 KB

A string pattern—matching algorithm

✍ Daniel K. Chang 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 944 KB

Parameterized Pattern Matching: Algorith

Parameterized Pattern Matching: Algorithms and Applications

✍ Brenda S. Baker 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 416 KB

The problem of finding sections of code that either are identical or are related by the systematic renaming of variables or constants can be modeled in terms of parameterized strings ( p-strings) and parameterized matches ( p-matches). P-strings are strings over two alphabets, one of which represent