✦ LIBER ✦

A New Efficient Algorithm for Computing the Longest Common Subsequence

✍ Scribed by Costas S. Iliopoulos; M. Sohel Rahman

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

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

Computing a longest common subsequence f

✍ W. J. Hsu; M. W. Du 📂 Article 📅 1984 🏛 Springer Netherlands 🌐 English ⚖ 832 KB

A longest common subsequence algorithm s

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

New systolic arrays for the longest comm

✍ Yen-Chun Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 KB

Time-Efficient Parallel Algorithms for t

✍ Jean-Frédéric Myoupo; David Semé 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 135 KB