...
首页> 外文期刊>Bioinformatics >Murlet: a practical multiple alignment tool for structural RNA sequences
【24h】

Murlet: a practical multiple alignment tool for structural RNA sequences

机译:Murlet:用于结构RNA序列的实用多重比对工具

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

摘要

Motivation: Structural RNA genes exhibit unique evolutionary patterns that are designed to conserve their secondary structures; these patterns should be taken into account while constructing accurate multiple alignments of RNA genes. The Sankoff algorithm is a natural alignment algorithm that includes the effect of base-pair covariation in the alignment model. However, the extremely high computational cost of the Sankoff algorithm precludes its application to most RNA sequences.Results: We propose an efficient algorithm for the multiple alignment of structural RNA sequences. Our algorithm is a variant of the Sankoff algorithm, and it uses an efficient scoring system that reduces the time and space requirements considerably without compromising on the alignment quality. First, our algorithm computes the match probability matrix that measures the alignability of each position pair between sequences as well as the base pairing probability matrix for each sequence. These probabilities are then combined to score the alignment using the Sankoff algorithm. By itself, our algorithm does not predict the consensus secondary structure of the alignment but uses external programs for the prediction. We demonstrate that both the alignment quality and the accuracy of the consensus secondary structure prediction from our alignment are the highest among the other programs examined. We also demonstrate that our algorithm can align relatively long RNA sequences such as the eukaryotic-type signal recognition particle RNA that is ~300 nt in length; multiple alignment of such sequences has not been possible by using other Sankoff-based algorithms. The algorithm is implemented in the software named 'Murlet'.
机译:动机:结构RNA基因表现出独特的进化模式,旨在保留其二级结构。在构建RNA基因的精确多重比对时,应考虑这些模式。 Sankoff算法是一种自然比对算法,其中包括比对模型中碱基对协变的影响。然而,Sankoff算法的计算成本极高,因此无法将其应用于大多数RNA序列。结果:我们提出了一种有效的算法,可对结构RNA序列进行多重比对。我们的算法是Sankoff算法的一种变体,它使用了有效的评分系统,可以在不影响对齐质量的情况下大大减少时间和空间要求。首先,我们的算法计算匹配概率矩阵,该矩阵测量序列之间每个位置对的可比性,以及每个序列的基础配对概率矩阵。然后,使用Sankoff算法将这些概率组合起来,对比对进行评分。就其本身而言,我们的算法不会预测比对的共识二级结构,而是使用外部程序进行预测。我们证明,在我们研究的其他程序中,比对质量和根据我们比对预测得出的共有二级结构预测的准确性均最高。我们还证明了我们的算法可以比对相对较长的RNA序列,例如长度约为300 nt的真核型信号识别颗粒RNA。通过使用其他基于Sankoff的算法,不可能对这些序列进行多重比对。该算法在名为“ Murlet”的软件中实现。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号