✦ LIBER ✦

Detecting False Matches in String-Matching Algorithms

✍ Scribed by S. Muthukrishnan

Book ID: 105746430
Publisher: Springer
Year: 1997
Tongue: English
Weight: 83 KB
Volume: 18
Category: Article
ISSN: 0178-4617
DOI: 10.1007/pl00009168

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for approximate string matchi

Algorithms for approximate string matching

✍ Esko Ukkonen 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 867 KB

A string pattern—matching algorithm

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

An approximate string-matching algorithm

✍ Jong Yong Kim; John Shawe-Taylor 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 774 KB

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

Optimal parallel algorithms for string m

Optimal parallel algorithms for string matching

✍ Zvi Galil 📂 Article 📅 1985 🏛 Elsevier Science ⚖ 744 KB

Fast string matching algorithms for run-

Fast string matching algorithms for run-length coded strings

✍ K. -L. Chung 📂 Article 📅 1995 🏛 Springer Vienna 🌐 English ⚖ 327 KB