✦ LIBER ✦

A fast algorithm for the longest-common-subsequence problem

✍ Scribed by Amar Mukhopadhyay

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

An algorithm for the longest cycle probl

✍ E. T. Dixon; S. E. Goodman 📂 Article 📅 1976 🏛 John Wiley and Sons 🌐 English ⚖ 504 KB

A fast algorithm for a redundancy optimi

✍ V.Dakshina Murty; K.B. Misra 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 400 KB

Fast computation evolutionary programmin

✍ P. Somasundaram; K. Kuppusamy; R. P. Kumudini Devi 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB

A fast and simple algorithm for the bott

✍ Abraham P. Punnen; K.P.K. Nair 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 323 KB

A simple algorithm for enumerating longe

✍ Matthew T. Dickerson; Jason Shugart 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 545 KB