✦ LIBER ✦

High precision simulations of the longest common subsequence problem

✍ Scribed by R. Bundschuh

Publisher: Springer
Year: 2001
Tongue: English
Weight: 205 KB
Volume: 22
Category: Article
ISSN: 1434-6036
DOI: 10.1007/s100510170102

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Longest Common Rigid Subsequence

On the Longest Common Rigid Subsequence Problem

✍ Nikhil Bansal; Moshe Lewenstein; Bin Ma; Kaizhong Zhang 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 320 KB

Thermodynamical Approach to the Longest

Thermodynamical Approach to the Longest Common Subsequence Problem

✍ Saba Amsalu; Heinrich Matzinger; Marina Vachkovskaia 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 405 KB

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

Analysis of Evolutionary Algorithms for

Analysis of Evolutionary Algorithms for the Longest Common Subsequence Problem

✍ Thomas Jansen; Dennis Weyland 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 429 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