✦ LIBER ✦

Fast two-dimensional pattern matching

✍ Scribed by Ricardo Baeza-Yates; Mireille Régnier

Book ID: 107766155
Publisher: Elsevier Science
Year: 1993
Tongue: English
Weight: 561 KB
Volume: 45
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(93)90250-d

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two dimensional pattern matching

✍ R.S. Bird 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 374 KB

Two-dimensional pattern matching by samp

Two-dimensional pattern matching by sampling

✍ Maxime Crochemore; Leszek Ga̧sieniec; Wojciech Rytter 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 302 KB

Two-dimensional pattern matching with k

Two-dimensional pattern matching with k mismatches

✍ Sanjay Ranka; Todd Heywood 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 700 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.

On two-dimensional pattern matching by o

On two-dimensional pattern matching by optimal parallel algorithms

✍ Maxime Crochemore; Wojciech Rytter 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 781 KB

Fast pattern matching in indexed texts

✍ Jean Senellart 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 309 KB

We present a simple and e cient algorithm for matching regular expression with texts, using full inverted text. It is based on the max-ow=min-cut algorithm, traditionaly employed to resolve linear problems. Our procedure constructs an optimal set of nodes for any automaton. They constitute the set o