✦ LIBER ✦

An Efficient Systolic Algorithm for the Longest Common Subsequence Problem

✍ Scribed by Yen-Chun Lin; Jyh-Chian Chen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A systolic array for the longest common

✍ Yves Robert; Maurice Tchuente 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 474 KB

New systolic arrays for the longest comm

✍ Yen-Chun Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 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

Algorithms for the Longest Common Subseq

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

A faster linear systolic algorithm for r

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