Mironov A A
Mol Biol (Mosk). 2007 Jul-Aug;41(4):711-8.
The RNA secondary structure prediction is a classical problem in bioinformatics. The most efficient approach to this problem is based on the idea of a comparative analysis. In this approach the algorithms utilize multiple alignment of the RNA sequences and find common RNA structure. This paper describes a new algorithm for this task. This algorithm does not require predefined multiple alignment. The main idea of the algorithm is based on MEME-like iterative searching of abstract profile on different levels. On the first level the algorithm searches the common blocks in the RNA sequences and creates chain of this blocks. On the next step the algorithm refines the chain of common blocks. On the last stage the algorithm searches sets of common helices that have consistent locations relative to common blocks. The algorithm was tested on sets of tRNA with a subset of junk sequences and on RFN riboswitches. The algorithm is implemented as a web server (http://bioinf.fbb.msu.ru/RNAAlign/).
RNA二级结构预测是生物信息学中的一个经典问题。解决这个问题最有效的方法是基于比较分析的思想。在这种方法中,算法利用RNA序列的多重比对来寻找共同的RNA结构。本文描述了一种用于此任务的新算法。该算法不需要预定义的多重比对。算法的主要思想基于在不同层次上类似MEME的抽象轮廓迭代搜索。在第一层次,算法在RNA序列中搜索共同的片段并创建这些片段的链。在下一步,算法优化共同片段的链。在最后阶段,算法搜索相对于共同片段具有一致位置的共同螺旋集。该算法在带有垃圾序列子集的tRNA集和RFN核糖开关上进行了测试。该算法被实现为一个网络服务器(http://bioinf.fbb.msu.ru/RNAAlign/)。