✦ LIBER ✦

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem

✍ Scribed by Thomas Jansen; Dennis Weyland

Publisher: Springer
Year: 2008
Tongue: English
Weight: 429 KB
Volume: 57
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-008-9243-6

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A fast algorithm for the longest-common-

A fast algorithm for the longest-common-subsequence problem

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

New systolic arrays for the longest comm

New systolic arrays for the longest common subsequence problem

✍ Yen-Chun Lin 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 555 KB

High precision simulations of the longes

High precision simulations of the longest common subsequence problem

✍ R. Bundschuh 📂 Article 📅 2001 🏛 Springer 🌐 English ⚖ 205 KB

Time-Efficient Parallel Algorithms for t

Time-Efficient Parallel Algorithms for the Longest Common Subsequence and Related Problems

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

The longest common subsequence problem f

The longest common subsequence problem for sequences with nested arc annotations

✍ Guohui Lin; Zhi-Zhong Chen; Tao Jiang; Jianjun Wen 📂 Article 📅 2002 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The Longest Arc-Preserving Common Subsequence (LAPCS) Problem has been introduced in Evans (Algorithms and complexity for annotated sequence analysis, Ph.D. Thesis, University of Victoria, 199

A fast and practical bit-vector algorith

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

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