✦ LIBER ✦

A two-step string-matching procedure

✍ Scribed by Shufen Kuo; George R. Cross

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 428 KB
Volume: 24
Category: Article
ISSN: 0031-3203
DOI: 10.1016/0031-3203(91)90038-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A string pattern—matching algorithm

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

A VLSI system for string matching

✍ Alan A. Bertossi 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 636 KB

Two recognizable string-matching problem

Two recognizable string-matching problems over free partially commutative monoids

✍ Kosaburo Hashiguchi; Kazuya Yamada 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 495 KB

A Comparison of Approximate String Match

A Comparison of Approximate String Matching Algorithms

✍ PETTERI JOKINEN; JORMA TARHIO; ESKO UKKONEN 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 972 KB

Experimental comparisons of the running time of approximate string matching algorithms for the k differences problem are presented. Given a pattern string, a text string, and an integer k, the task is to find all approximate occurrences of the pattern in the text with at most k differences (insertio

Simple Optimal String Matching Algorithm

✍ Cyril Allauzen; Mathieu Raffinot 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 140 KB

We present a new string matching algorithm optimal on average (with equiprobability and independence of letters, in O m + n log m/m , where n is the size of the text and m the size of the searched word, both taken on an alphabet ) and linear in the worst case (in O m + n ). Of all the algorithms tha

Time-space-optimal string matching

✍ Zvi Galil; Joel Seiferas 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 875 KB