Abstract
Arc-annotated sequences are useful in representing the struc-tural information of RNA and protein sequences. Recently, the longest arc-preserving common subsequence problem has been introduced in [6,7] as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc struc-tures and present some new algorithmic and complexity results on the longest arc-preserving common subsequence problem. Some of our results answer an open question in [6,7] and some others improve the hardness results in [6,7].
Author supplied keywords
Cite
CITATION STYLE
Jiang, T., Lin, G. H., Ma, B., & Zhang, K. (2000). The longest common subsequence problem for arc-annotated sequences. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1848, pp. 154–165). Springer Verlag. https://doi.org/10.1007/3-540-45123-4_15
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
