首页> 外文期刊>Bioinformatics >A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences
【24h】

A graph theoretical approach for predicting common RNA secondary structure motifs including pseudoknots in unaligned sequences

机译:图论方法用于预测常见RNA二级结构基序,包括未比对序列中的假结

获取原文
获取原文并翻译 | 示例
       

摘要

Motivation: RNA structure motifs contained in mRNAs have been found to play important roles in regulating gene expression. However, identification of novel RNA regulatory motifs using computational methods has not been widely explored. Effective tools for predicting novel RNA regulatory motifs based on genomic sequences are needed. Results: We present a new method for predicting common RNA secondary structure motifs in a set of functionally or evolutionarily related RNA sequences. This method is based on comparison of stems (palindromic helices) between sequences and is implemented by applying graph-theoretical approaches. It first finds all possible stable stems in each sequence and compares stems pairwise between sequences by some defined features to find stems conserved across any two sequences. Then by applying a maximum clique finding algorithm, it finds all significant stems conserved across at least k sequences. Finally, it assembles in topological order all possible compatible conserved stems shared by at least k sequences and reports a number of the best assembled stem sets as the best candidate common structure motifs. This method does not require prior structural alignment of the sequences and is able to detect pseudoknot structures. We have tested this approach on some RNA sequences with known secondary structures, in which it is capable of detecting the real structures completely or partially correctly and outperforms other existing programs for similar purposes.
机译:动机:已发现mRNA中包含的RNA结构基序在调节基因表达中起重要作用。但是,尚未广泛探索使用计算方法鉴定新型RNA调控基序。需要有效的工具来预测基于基因组序列的新型RNA调控基序。结果:我们提出了一种预测一组功能或进化相关的RNA序列中常见的RNA二级结构基序的新方法。该方法基于序列之间茎(回文螺旋)的比较,并通过应用图论方法实现。它首先找到每个序列中所有可能的稳定茎,并通过某些定义的特征对序列之间的茎进行成对比较,以找到在任何两个序列中均保守的茎。然后通过应用最大集团发现算法,它找到在至少k个序列中保守的所有重要茎。最后,它以拓扑顺序组装了至少k个序列共有的所有可能的相容保守茎,并报告了许多最佳组装茎集作为最佳候选通用结构基序。该方法不需要先验序列的结构比对,并且能够检测假结结构。我们已经在具有已知二级结构的某些RNA序列上测试了该方法,其中该方法能够完全或部分正确地检测真实结构,并且出于类似目的优于其他现有程序。

著录项

  • 来源
    《Bioinformatics》 |2004年第10期|p. 1591-1602|共12页
  • 作者单位

    Department of Genetics, Washington University, School of Medicine, St. Louis, MO 63110, USA;

    Department of Genetics, Washington University, School of Medicine, St. Louis, MO 63110, USA;

    Department of Genetics, Washington University, School of Medicine, St. Louis, MO 63110, USA;

  • 收录信息 美国《科学引文索引》(SCI);美国《化学文摘》(CA);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类 生物科学;
  • 关键词

  • 入库时间 2022-08-17 23:50:16

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号