✦ LIBER ✦

A New Progressive Algorithm for a Multiple Longest Common Subsequences Problem and Its Efficient Parallelization

✍ Scribed by Yang, Jiaoyun; Xu, Yun; Sun, Guangzhong; Shang, Yi

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Time-Efficient Parallel Algorithms for t

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

A New Efficient Algorithm for Computing

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

A Coarse-Grained Parallel Algorithm for

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

A fast and practical bit-vector algorith

✍ Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 269 KB

A new algorithm for the Integer Knapsack

✍ F. Almeida; F. García; D. Morales; J. Roda; C. Rodríguez 📂 Article 📅 1995 🏛 Springer-Verlag 🌐 English ⚖ 588 KB

A new optimal algorithm for the permutat

✍ Shusuke Okamoto; Ichie Watanabe; Hajime Iizuka 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 326 KB