✦ LIBER ✦

A faster linear systolic algorithm for recovering a longest common subsequence

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

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A linear space algorithm for computing a

✍ Yoshifumi Sakai 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 107 KB

Faster algorithms for computing longest

✍ Martin Kutz; Gerth Stølting Brodal; Kanela Kaligosi; Irit Katriel 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 261 KB

An Efficient Systolic Algorithm for the

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

A linear algorithm for 3-letter longest

✍ Duraj, Lech 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 156 KB

A systolic array for the longest common

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

A bit-string longest-common-subsequence

✍ Lloyd Allison; Trevor I. Dix 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 331 KB