✦ LIBER ✦

Approximate string matching with suffix automata

✍ Scribed by Esko Ukkonen; Derick Wood

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

Improved Approximate String Matching Usi

✍ Tak-Wah Lam; Wing-Kin Sung; Swee-Seong Wong 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 396 KB

Efficient Algorithms for Approximate Str

✍ Dong Kyue Kim; Jee-Soo Lee; Kunsoo Park; Yookun Cho 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 357 KB

Fast and practical approximate string ma

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

Approximate string matching for music an

✍ R. Clifford; C. Iliopoulos 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 305 KB