✦ LIBER ✦

A pattern matching system

✍ Scribed by Ian Sommerville

Book ID: 112209950
Publisher: John Wiley and Sons
Year: 1982
Tongue: English
Weight: 833 KB
Volume: 12
Category: Article
ISSN: 0038-0644
DOI: 10.1002/spe.4380120604

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Collage system: a unifying framework for

Collage system: a unifying framework for compressed pattern matching

✍ Takuya Kida; Tetsuya Matsumoto; Yusuke Shibata; Masayuki Takeda; Ayumi Shinohara 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 234 KB

We introduce a general framework which is suitable to capture the essence of compressed pattern matching according to various dictionary-based compressions. It is a formal system to represent a string by a pair of dictionary D and sequence S of phrases in D. The basic operations are concatenation, t

A Pattern-Matching Compiler

✍ Pierre-Etienne Moreau; Christophe Ringeissen; Marian Vittek 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 200 KB

A point pattern matching algorithm

✍ Shinji Umeyama 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 798 KB

A string pattern—matching algorithm

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

Statistical pattern matching

✍ Thomas G. Ryall; John Sandor 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 286 KB

Inverse Pattern Matching

✍ Amihood Amir; Alberto Apostolico; Moshe Lewenstein 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 181 KB

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 additi