✦ LIBER ✦

On-line approximate string matching with bounded errors

✍ Scribed by Marcos Kiwi; Gonzalo Navarro; Claudio Telha

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximate string matching with address

✍ Amihood Amir; Yonatan Aumann; Oren Kapah; Avivit Levy; Ely Porat 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 721 KB

On-line string matching with feedback

✍ Peter Johansen 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 916 KB

Approximate string matching with suffix

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

An approximate string matching algorithm

✍ Derek C.W. Pao; M.C. Sun; Murphy C.H. Lam 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 900 KB

Approximate string matching with don't c

✍ Tatsuya Akutsu 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 463 KB

Efficient Algorithms for Approximate Str

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