...
  • 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>IAENG Internaitonal journal of computer science >The c-Fragment Longest Arc-Preserving Common Subsequence Problem
【24h】

The c-Fragment Longest Arc-Preserving Common Subsequence Problem

机译：c片段最长保弧公共子序列问题

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Arc-annotated sequences are useful in representing the structural information of RNA and protein sequences. In particular, arc-annotated sequences are useful in describing the secondary and tertiary structures of RNA and protein sequences. Structure comparison for RNA and for protein sequences has become a central computational problem bearing many challenging computer science questions. The longest arc-preserving common subsequence problem has been introduced as a framework for studying the similarity of arc-annotated sequences. It is a sound and meaningful mathematical formal-ization of comparing the secondary structures of molecular sequences. In this paper, we consider two special cases of the longest arc-preserving common subsequence problem, c-fragment LAPCS (unlimited, plain), c-fragment LAPCS (unlimited, unlimited). In particular, we consider a parameterized version of the 1-fragment LAPCS (unlimited, plain) problem, parameterized by the length ι of the desired subsequence. We show W[l]-completeness of the problem. Also, we describe an approach to solve c-fragment LAPCS (unlimited, unlimited). This approach is based on constructing logical models for the problem.
机译：带弧注释的序列可用于表示RNA和蛋白质序列的结构信息。特别地，带弧注释的序列可用于描述RNA和蛋白质序列的二级和三级结构。 RNA和蛋白质序列的结构比较已成为一个中心计算问题，涉及许多计算机科学难题。引入了最长的保弧公共子序列问题作为研究弧注释序列相似性的框架。这是比较分子序列的二级结构的合理而有意义的数学形式化。在本文中，我们考虑了两个最长保弧公共子序列问题的特殊情况，即c片段LAPCS（无限制，无格式）和c片段LAPCS（无限制，无限制）。特别地，我们考虑了1-片段LAPCS（无限制，普通）问题的参数化版本，该参数化版本由所需子序列的长度i进行参数化。我们证明了问题的W [l]完备性。此外，我们描述了一种解决c片段LAPCS（无限制，无限制）的方法。此方法基于构建问题的逻辑模型。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号