✦ LIBER ✦

The longest common subsequence problem for sequences with nested arc annotations

✍ Scribed by Guohui Lin; Zhi-Zhong Chen; Tao Jiang; Jianjun Wen

Publisher: Elsevier Science
Year: 2002
Tongue: English
Weight: 254 KB
Volume: 65
Category: Article
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(02)00004-1

No coin nor oath required. For personal study only.

✦ Synopsis

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, 1999) as a framework for studying the similarity of arc-annotated sequences. Several algorithmic and complexity results on the LAPCS problem have been presented in Evans (1999) and Jiang et al. (in:

📜 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

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

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