The tedious task of finding homologous noncoding RNA genes.
User-driven in silico RNA homology search is still a nontrivial task. In part, this is the consequence of a limited precision of the computational tools in spite of recent exciting progress in this area, and to a certain extent, computational costs are still problematic in practice. An important, and as we argue here, dominating issue is the dependence on good curated (secondary) structural alignments of the RNAs. These are often hard to obtain, not so much because of an inherent limitation in the available data, but because they require substantial manual curation, an effort that is rarely acknowledged. Here, we qualitatively describe a realistic scenario for what a "regular user" (i.e., a nonexpert in a particular RNA family) can do in practice, and what kind of results are likely to be achieved. Despite the indisputable advances in computational RNA biology, the conclusion is discouraging: BLAST still works better or equally good as other methods unless extensive expert knowledge on the RNA family is included. However, when good curated data are available the recent development yields further improvements in finding remote homologs. Homology search beyond the reach of BLAST hence is not at all a routine task.
Section for Genetics and Bioinformatics, IBHV, and Center for Applied Bioinformatics, University of Copenhagen, DK-1870 Frederiksberg, Denmark.
Peter
P
Menzel
Jan
J
Gorodkin
Peter F
PF
Stadler
D000818:Animals; D019295:Computational Biology; D006801:Humans; D009690:Nucleic Acid Conformation; D022661:RNA, Untranslated / Q000737:chemistry* / Q000235:genetics*; D017422:Sequence Analysis, DNA; D012689:Sequence Homology, Nucleic Acid
D022661:RNA, Untranslated