Skip Navigation



Bioinformatics Advance Access published online on April 13, 2006

Bioinformatics, doi:10.1093/bioinformatics/btl142
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
22/13/1593    most recent
btl142v1
Right arrow Comments: Submit a response
Right arrow Alert me when this article is cited
Right arrow Alert me when Comments are posted
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Dalli, D.
Right arrow Articles by Steger, G.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Dalli, D.
Right arrow Articles by Steger, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2006). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org
Received February 10, 2006
Revised April 10, 2006
Accepted April 10, 2006

Article

STRAL: progressive alignment of non-coding RNA using base pairing probability vectors in quadratic time

Deniz Dalli 1, Andreas Wilm 1, Indra Mainz 1, and Gerhard Steger 1 *

1 Heinrich-Heine-Universität Düsseldorf, Institut für Physikalische Biologie, D-40225 Düsseldorf, Germany

* To whom correspondence should be addressed.
Gerhard Steger, E-mail: stral{at}biophys.uni-duesseldorf.de


   Abstract

Motivation: Alignment of RNA has a wide range of applications, for example in phylogeny inference, consensus structure prediction and homology searches. Yet, aligning structural or non-coding RNAs (ncRNAs) correctly is notoriously difficult as these RNA sequences may evolve by compensatory mutations, which maintain base pairing but destroy sequence homology. Ideally, alignment programs would take RNA structure into account. The Sankoff algorithm for the simultaneous solution of RNA structure prediction and RNA sequence alignment has been proposed twenty years ago, but suffers from its exponential complexity. A number of programs implement lightweight versions of the Sankoff algorithm by restricting its application to a limited type of structures and/or only pairwise alignment. Thus, despite recent advances, the proper alignment of multiple structural RNA sequences still remains a problem.

Results: Here we present STRAL, a heuristic method for alignment of ncRNA that reduces sequence-structure alignment to a two-dimensional problem similar to standard multiple sequence alignment. The scoring function takes into account sequence similarity as well as up- and down-stream pairing probability. To test the robustness of the algorithm and the performance of the program, we scored alignments produced by STRAL in comparison to a large set of published reference alignments. Quality of alignments predicted by STRAL is far better than that obtained by standard sequence alignment programs, especially when sequence homologies drop below ~65 %; nevertheless STRAL's runtime is comparable to that of CLUSTALW.

Availability: STRAL is implemented in C. Source code (under GNU Public License) as well as a precompiled Debian package can be downloaded at http://www.biophys.uni-duesseldorf.de/stral/.


Associate Editor: Alex Bateman
Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
Nucleic Acids ResHome page
R. R. Stocsits, H. Letsch, J. Hertel, B. Misof, and P. F. Stadler
Accurate and efficient reconstruction of deep phylogenies from structured RNAs
Nucleic Acids Res., October 1, 2009; 37(18): 6184 - 6193.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Y. Tabei and K. Asai
A local multiple alignment method for detection of non-coding RNA sequences
Bioinformatics, June 15, 2009; 25(12): 1498 - 1505.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
K. Morita, Y. Saito, K. Sato, K. Oka, K. Hotta, and Y. Sakakibara
Genome-wide searching with base-pairing kernel functions for noncoding RNAs: computational and expression analysis of snoRNA families in Caenorhabditis elegans
Nucleic Acids Res., February 1, 2009; 37(3): 999 - 1009.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
K. Katoh and H. Toh
Recent developments in the MAFFT multiple sequence alignment program
Brief Bioinform, July 1, 2008; 9(4): 286 - 298.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
C. B. Do, C.-S. Foo, and S. Batzoglou
A max-margin model for efficient simultaneous alignment and folding of RNA sequences
Bioinformatics, July 1, 2008; 24(13): i68 - i76.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
S. Moretti, A. Wilm, D. G. Higgins, I. Xenarios, and C. Notredame
R-Coffee: a web server for accurately aligning noncoding RNA sequences
Nucleic Acids Res., July 1, 2008; 36(suppl_2): W10 - W13.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
A. Wilm, D. G. Higgins, and C. Notredame
R-Coffee: a method for multiple alignment of non-coding RNA
Nucleic Acids Res., May 1, 2008; 36(9): e52 - e52.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
F. Ferre, Y. Ponty, W. A. Lorenz, and P. Clote
DIAL: a web server for the pairwise alignment of two RNA three-dimensional structures using nucleotide, dihedral angle and base-pairing similarities
Nucleic Acids Res., July 13, 2007; 35(suppl_2): W659 - W668.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
E. Torarinsson, J. H. Havgaard, and J. Gorodkin
Multiple structural alignment and clustering of RNA sequences
Bioinformatics, April 15, 2007; 23(8): 926 - 932.
[Abstract] [Full Text] [PDF]



Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.