基于比较方法的RNA二级结构自动预测

Fariza Tahi , Manolo Gouy , Mireille Régnier
{"title":"基于比较方法的RNA二级结构自动预测","authors":"Fariza Tahi ,&nbsp;Manolo Gouy ,&nbsp;Mireille Régnier","doi":"10.1016/S0097-8485(02)00012-8","DOIUrl":null,"url":null,"abstract":"<div><p>This paper presents an algorithm, DCFold, that automatically predicts the common secondary structure of a set of aligned homologous RNA sequences. It is based on the comparative approach. Helices are searched in one of the sequences, called the ‘target sequence’, and compared to the helices in the other sequences, called the ‘test sequences’. Our algorithm searches in the target sequence for palindromes that have a high probability to define helices that are conserved in the test sequences. This selection of significant palindromes is based on criteria that take into account their length and their mutation rate. A recursive search of helices, starting from these likely ones, is implemented using the ‘divide and conquer’ approach. Indeed, as pseudo-knots are not searched by DCFold, a selected palindrome (<em>p</em>,<!--> <em>p</em>′) makes possible to divide the initial sequence into two sequences, the internal one and the one resulting from the concatenation of the two external ones. New palindromes can be searched independently in these subsequences. This algorithm was run on ribosomal RNA sequences and recovered very efficiently their common secondary structures.</p></div>","PeriodicalId":79331,"journal":{"name":"Computers & chemistry","volume":"26 5","pages":"Pages 521-530"},"PeriodicalIF":0.0000,"publicationDate":"2002-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1016/S0097-8485(02)00012-8","citationCount":"26","resultStr":"{\"title\":\"Automatic RNA secondary structure prediction with a comparative approach\",\"authors\":\"Fariza Tahi ,&nbsp;Manolo Gouy ,&nbsp;Mireille Régnier\",\"doi\":\"10.1016/S0097-8485(02)00012-8\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"<div><p>This paper presents an algorithm, DCFold, that automatically predicts the common secondary structure of a set of aligned homologous RNA sequences. It is based on the comparative approach. Helices are searched in one of the sequences, called the ‘target sequence’, and compared to the helices in the other sequences, called the ‘test sequences’. Our algorithm searches in the target sequence for palindromes that have a high probability to define helices that are conserved in the test sequences. This selection of significant palindromes is based on criteria that take into account their length and their mutation rate. A recursive search of helices, starting from these likely ones, is implemented using the ‘divide and conquer’ approach. Indeed, as pseudo-knots are not searched by DCFold, a selected palindrome (<em>p</em>,<!--> <em>p</em>′) makes possible to divide the initial sequence into two sequences, the internal one and the one resulting from the concatenation of the two external ones. New palindromes can be searched independently in these subsequences. This algorithm was run on ribosomal RNA sequences and recovered very efficiently their common secondary structures.</p></div>\",\"PeriodicalId\":79331,\"journal\":{\"name\":\"Computers & chemistry\",\"volume\":\"26 5\",\"pages\":\"Pages 521-530\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2002-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"https://sci-hub-pdf.com/10.1016/S0097-8485(02)00012-8\",\"citationCount\":\"26\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Computers & chemistry\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://www.sciencedirect.com/science/article/pii/S0097848502000128\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Computers & chemistry","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0097848502000128","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 26

摘要

本文提出了一种自动预测一组同源RNA序列的共同二级结构的算法dcold。它是基于比较的方法。在其中一个序列(称为“目标序列”)中搜索螺旋,并与其他序列(称为“测试序列”)中的螺旋进行比较。我们的算法在目标序列中搜索具有高概率定义在测试序列中保守的螺旋的回文。这种重要回文的选择是基于考虑到它们的长度和突变率的标准。螺旋的递归搜索,从这些可能的螺旋开始,使用“分而治之”的方法实现。实际上,由于dcold不搜索伪结,因此选择回文(p, p ')可以将初始序列分为两个序列,一个是内部序列,另一个是由两个外部序列串联而成的序列。新的回文可以在这些子序列中独立搜索。该算法在核糖体RNA序列上运行,并非常有效地恢复了它们的共同二级结构。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Automatic RNA secondary structure prediction with a comparative approach

This paper presents an algorithm, DCFold, that automatically predicts the common secondary structure of a set of aligned homologous RNA sequences. It is based on the comparative approach. Helices are searched in one of the sequences, called the ‘target sequence’, and compared to the helices in the other sequences, called the ‘test sequences’. Our algorithm searches in the target sequence for palindromes that have a high probability to define helices that are conserved in the test sequences. This selection of significant palindromes is based on criteria that take into account their length and their mutation rate. A recursive search of helices, starting from these likely ones, is implemented using the ‘divide and conquer’ approach. Indeed, as pseudo-knots are not searched by DCFold, a selected palindrome (p, p′) makes possible to divide the initial sequence into two sequences, the internal one and the one resulting from the concatenation of the two external ones. New palindromes can be searched independently in these subsequences. This algorithm was run on ribosomal RNA sequences and recovered very efficiently their common secondary structures.

求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信