✦ LIBER ✦

Fast and practical approximate string matching

✍ Scribed by Ricardo A. Baeza-Yates; Chris H. Perleberg

Publisher: Elsevier Science
Year: 1996
Tongue: English
Weight: 598 KB
Volume: 59
Category: Article
ISSN: 0020-0190
DOI: 10.1016/0020-0190(96)00083-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Fast parallel and serial approximate str

Fast parallel and serial approximate string matching

✍ Gad M Landau; Uzi Vishkin 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 755 KB

A fast VLSI solution for approximate str

A fast VLSI solution for approximate string matching

✍ Roberto Grossi 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 711 KB

An approximate string-matching algorithm

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

Fast parallel string prefix-matching

✍ Dany Breslauer 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 761 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

Fast string matching with k differences

✍ Gad M. Landau; Uzi Vishkin 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 953 KB