✦ LIBER ✦

A bit-string longest-common-subsequence algorithm

✍ Scribed by Lloyd Allison; Trevor I. Dix

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast and practical bit-vector algorith

✍ Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 269 KB

A longest common subsequence algorithm s

✍ Narao Nakatsu; Yahiko Kambayashi; Shuzo Yajima 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 404 KB

A fast algorithm for the longest-common-

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

A New Efficient Algorithm for Computing

✍ Costas S. Iliopoulos; M. Sohel Rahman 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 444 KB

A linear space algorithm for computing a

✍ Yoshifumi Sakai 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 107 KB

A faster linear systolic algorithm for r

✍ Thierry Lecroq; Guillaume Luce; Jean Frédéric Myoupo 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 530 KB