✦ LIBER ✦

Remark on the HSUDU new algorithm for the longest common subsequence problem

✍ Scribed by Alberto Apostolico

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

Algorithms for the Longest Common Subseq

✍ Hirschberg, Daniel S. 📂 Article 📅 1977 🏛 Association for Computing Machinery 🌐 English ⚖ 738 KB

An Efficient Systolic Algorithm for the

✍ Yen-Chun Lin; Jyh-Chian Chen 📂 Article 📅 1998 🏛 Springer US 🌐 English ⚖ 226 KB

New systolic arrays for the longest comm

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

On the Longest Common Rigid Subsequence

✍ Nikhil Bansal; Moshe Lewenstein; Bin Ma; Kaizhong Zhang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 320 KB

A New Efficient Algorithm for Computing

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