RScan: fast searching structural similarities for structured RNAs in large databases

被引:2
|
作者
Xue, Chenghai [1 ]
Liu, Guo-Ping
机构
[1] Tsinghua Univ, Dept Automat, TNLIST, MOE Key Lab Bioinformat, Beijing 100084, Peoples R China
[2] Tsinghua Univ, Dept Automat, TNLIST, Bioinformat Div, Beijing 100084, Peoples R China
[3] Chinese Acad Sci, LCSIS, Inst Automat, Beijing 100080, Peoples R China
[4] Univ Glamorgan, Dept Engn, Pontypridd CF37 1DL, M Glam, Wales
基金
英国惠康基金;
关键词
D O I
10.1186/1471-2164-8-257
中图分类号
Q81 [生物工程学(生物技术)]; Q93 [微生物学];
学科分类号
071005 ; 0836 ; 090102 ; 100705 ;
摘要
Background: Many RNAs have evolutionarily conserved secondary structures instead of primary sequences. Recently, there are an increasing number of methods being developed with focus on the structural alignments for finding conserved secondary structures as well as common structural motifs in pair-wise or multiple sequences. A challenging task is to search similar structures quickly for structured RNA sequences in large genomic databases since existing methods are too slow to be used in large databases. Results: An implementation of a fast structural alignment algorithm, RScan, is proposed to fulfill the task. RScan is developed by levering the advantages of both hashing algorithms and local alignment algorithms. In our experiment, on the average, the times for searching a tRNA and an rRNA in the randomized A. pernix genome are only 256 seconds and 832 seconds respectively by using RScan, but need 3,178 seconds and 8,951 seconds respectively by using an existing method RSEARCH. Remarkably, RScan can handle large database queries, taking less than 4 minutes for searching similar structures for a microRNA precursor in human chromosome 21. Conclusion: These results indicate that RScan is a preferable choice for real-life application of searching structural similarities for structured RNAs in large databases.
引用
收藏
页数:11
相关论文
共 50 条