The Longest Common Subsequence Problem for Sequences with Nested Arc Annotations


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… (More)
DOI: 10.1016/S0022-0000(02)00004-1


4 Figures and Tables