弧注释序列的弧保持连续性
Arc-preserving subsequences of arc-annotated sequences
摘要：
弧形注释序列在表示RNA和蛋白质序列的结构信息方面是有用的。最长弧保持公共子序列问题已被引入作为一个框架，研究弧注释序列的相似性。在本文中，我们考虑弧注释序列与各种弧结构。考虑了最长弧保持公共子序列问题。特别是，我们证明了1-{ \sc片段LAPCS（交叉，链）}的决策版本和0-{ \sc对角LAPCS（交叉，链）}的决策版本是{ \bf NP}-完全的一些固定的字母表$Σ$，使$|Σ| = 2$。我们还证明了如果$|Σ| = 1$，则1-{ \sc片段LAPCS（unlimited，plain）}的判定版本和0-{ \sc对角LAPCS（unlimited，plain）}的判定版本是{ \bf NP}-完全的.
英文摘要：
Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. In this paper, we consider arc-annotated sequences with various arc structures. We consider the longest arc preserving common subsequence problem. In particular, we show that the decision version of the 1-{\sc fragment LAPCS(crossing,chain)} and the decision version of the 0-{\sc diagonal LAPCS(crossing,chain)} are {\bf NP}-complete for some fixed alphabet $Σ$ such that $|Σ| = 2$. Also we show that if $|Σ| = 1$, then the decision version of the 1-{\sc fragment LAPCS(unlimited, plain)} and the decision version of the 0-{\sc diagonal LAPCS(unlimited, plain)} are {\bf NP}-complete.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
