✦ LIBER ✦

Efficient algorithms for the longest common subsequence problem with sequential substring constraints

✍ Scribed by Tseng, Chiou-Ting; Yang, Chang-Biau; Ann, Hsing-Yen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for the Longest Common Subseq

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

A Coarse-Grained Parallel Algorithm for

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

Analysis of Evolutionary Algorithms for

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 KB

An Efficient Systolic Algorithm for the

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

The substring inclusion constraint longe

✍ Alam, Muhammad Rashed; Sohel Rahman, M. 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 164 KB

Time-Efficient Parallel Algorithms for t

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