✦ LIBER ✦

Improved Approximate String Matching Using

✍ Scribed by Tak-Wah Lam; Wing-Kin Sung; Swee-Seong Wong

Publisher: Springer
Year: 2007
Tongue: English
Weight: 396 KB
Volume: 51
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9104-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Faster Approximate String Matching

✍ R. Baeza-Yates and G. Navarro 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 479 KB

An approximate string-matching algorithm

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

Fast and practical approximate string ma

Fast and practical approximate string matching

✍ Ricardo A. Baeza-Yates; Chris H. Perleberg 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 598 KB

Approximate string matching with suffix

Approximate string matching with suffix automata

✍ Esko Ukkonen; Derick Wood 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 594 KB

Approximate string matching for music an

Approximate string matching for music analysis

✍ R. Clifford; C. Iliopoulos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 305 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