✦ LIBER ✦

A fast and practical bit-vector algorithm for the Longest Common Subsequence problem

✍ Scribed by Maxime Crochemore; Costas S. Iliopoulos; Yoan J. Pinzon; James F. Reid

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the longest-common-

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

Time-Efficient Parallel Algorithms for t

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

A fast cost-optimal parallel algorithm f

✍ R Lin; S Olariu 📂 Article 📅 1992 🏛 Elsevier Science 🌐 English ⚖ 548 KB

A combined BIT and TIMESTAMP algorithm f

✍ Susanne Albers; Bernhard von Stengel; Ralph Werchner 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 477 KB

A branch-and-bound algorithm for the two

✍ Frits C.R. Spieksma 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 661 KB

A fast and simple algorithm for the bott

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