✦ LIBER ✦

A longest common subsequence algorithm suitable for similar text strings

✍ Scribed by Narao Nakatsu; Yahiko Kambayashi; Shuzo Yajima

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computing a longest common subsequence f

✍ W. J. Hsu; M. W. Du 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 832 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

Efficient algorithms for finding a longe

✍ Wun-Tat Chan; Yong Zhang; Stanley P. Y. Fung; Deshi Ye; Hong Zhu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 316 KB

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 Coarse-Grained Parallel Algorithm for

✍ Carlos E.R. Alves; Edson N. Caceres; Siang Wun Song 📂 Article 📅 2006 🏛 Springer 🌐 English ⚖ 377 KB