✦ LIBER ✦

Experimenting with pattern-matching algorithms

✍ Scribed by Yannis Manolopoulos; Christos Faloutsos

Book ID: 107767604
Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 662 KB
Volume: 90
Category: Article
ISSN: 0020-0255
DOI: 10.1016/0020-0255(95)00280-4

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Stochastic optimization algorithms — an

Stochastic optimization algorithms — an application to pattern matching

✍ Mats Bengtsson 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 535 KB

Approximate input sensitive algorithms f

Approximate input sensitive algorithms for point pattern matching

✍ Dror Aiger; Klara Kedem 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 486 KB

Analysis of two-dimensional approximate

Analysis of two-dimensional approximate pattern matching algorithms

✍ Park Kunsoo 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 717 KB

We present a new and more rigorous analysis of the two algorithms for two-dimensional approximate pattern matching due to KtikkEnen and Ukkonen. We also present modifications of these algorithms that use less space while keeping the same expected time.

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