✦ LIBER ✦

Efficient algorithms for finding a longest common increasing subsequence

✍ Scribed by Wun-Tat Chan; Yong Zhang; Stanley P. Y. Fung; Deshi Ye; Hong Zhu

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A New Efficient Algorithm for Computing

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

Time-Efficient Parallel Algorithms for t

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

Finding longest increasing and common su

✍ David Liben-Nowell; Erik Vee; An Zhu 📂 Article 📅 2006 🏛 Springer US 🌐 English ⚖ 575 KB

Analysis of Evolutionary Algorithms for

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

A fast algorithm for the longest-common-

✍ Amar Mukhopadhyay 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 696 KB

A longest common subsequence algorithm s

✍ Narao Nakatsu; Yahiko Kambayashi; Shuzo Yajima 📂 Article 📅 1982 🏛 Springer-Verlag 🌐 English ⚖ 404 KB