✦ LIBER ✦

Computing a longest common subsequence for a set of strings

✍ Scribed by W. J. Hsu; M. W. Du

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A longest common subsequence algorithm s

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

A New Efficient Algorithm for Computing

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

A fast algorithm for the longest-common-

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 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

Performance analysis of some simple heur

✍ F. Chin; C. K. Poon 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 955 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