✦ LIBER ✦

A hybrid genetic algorithm for the repetition free longest common subsequence problem

✍ Scribed by Castelli, Mauro; Beretta, Stefano; Vanneschi, Leonardo

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

On the parameterized complexity of the r

✍ Guillaume Blin; Paola Bonizzoni; Riccardo Dondi; Florian Sikora 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 149 KB

An Efficient Systolic Algorithm for the

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

Algorithms for the Longest Common Subseq

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

A systolic array for the longest common

✍ Yves Robert; Maurice Tchuente 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 474 KB

A hyper-heuristic for the Longest Common

✍ Farzaneh Sadat Tabataba; Sayyed Rasoul Mousavi 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 500 KB