✦ LIBER ✦

Systolic-based parallel architecture for the longest common subsequences problem

✍ Scribed by Guillaume Luce; Jean Frédéric Myoupo

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

An Efficient Systolic Algorithm for the

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

Algorithms for the Longest Common Subseq

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

Time-Efficient Parallel Algorithms for t

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

A Coarse-Grained Parallel Algorithm for

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