✦ LIBER ✦

Approximate Matching of Run-Length Compressed Strings

✍ Scribed by Veli Mäkinen, Esko Ukkonen and Gonzalo Navarro

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Matching for Run-Length Encoded Strings

✍ Alberto Apostolico; Gad M Landau; Steven Skiena 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 300 KB

Binary jumbled string matching for highl

✍ Badkobeh, Golnaz; Fici, Gabriele; Kroon, Steve; Lipták, Zsuzsanna 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 263 KB

An algorithm for matching run-length cod

✍ H. Bunke; J. Csirik 📂 Article 📅 1993 🏛 Springer Vienna 🌐 English ⚖ 803 KB

Fast string matching algorithms for run-

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

A Fully Compressed Algorithm for Computi

✍ Kuan-Yu Chen, Kun-Mao Chao 📂 Article 📅 2011 🏛 Springer 🌐 English ⚖ 670 KB

Efficient retrieval of approximate palin

✍ Kuan-Yu Chen; Ping-Hui Hsu; Kun-Mao Chao 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 347 KB