Skip Navigation

Nucleic Acids Research 2004 32(Web Server Issue):W146-W149; doi:10.1093/nar/gkh444
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (189K) Freely available
Right arrow Alert me when this article is cited
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 arrow Commercial Re-use Guidelines
for Open Access NAR Content
Google Scholar
Right arrow Articles by Ruan, J.
Right arrow Articles by Zhang, W.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Ruan, J.
Right arrow Articles by Zhang, W.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© 2004, the authors
Nucleic Acids Research, Vol. 32, Web Server issue © Oxford University Press 2004; all rights reserved

ILM: a web server for predicting RNA secondary structures with pseudoknots

Jianhua Ruan1, Gary D. Stormo2,1 and Weixiong Zhang1,2,*

1 Department of Computer Science and Engineering and 2 Department of Genetics, Washington University in St Louis, St Louis, MO 63130, USA

* To whom correspondence should be addressed. Tel: +1 314 935 8788; Fax: +1 314 935 7302; Email: zhang{at}cse.wustl.edu

Received February 15, 2004; Revised and Accepted April 20, 2004

The ILM web server provides a web interface to two algorithms, iterated loop matching and maximum weighted matching, for efficiently predicting RNA secondary structures with pseudoknots. The algorithms can utilize either thermodynamic or comparative information or both, and thus can work on both aligned and individual sequences. Predicted secondary structures are presented in several formats compatible with a variety of existing visualization tools. The service can be accessed at http://cic.cs.wustl.edu/RNA/.


The online version of this article has been published under an open access model. Users are entitled to use, reproduce, disseminate, or display the open access version of this article provided that: the original authorship is properly and fully attributed; the Journal and Oxford University Press are attributed as the original place of publication with the correct citation details given; if an article is subsequently reproduced or disseminated not in its entirety but only in part or as a derivative work this must be clearly indicated.


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
J. Virol.Home page
S. J. Schroeder
Advances in RNA Structure Prediction from Sequence: New Tools for Generating Hypotheses about Viral RNA Structure-Function Relationships
J. Virol., July 1, 2009; 83(13): 6326 - 6334.
[Full Text] [PDF]


Home page
RNAHome page
A. L. Cerrone-Szakal, D. M. Chadalavada, B. L. Golden, and P. C. Bevilacqua
Mechanistic characterization of the HDV genomic ribozyme: The cleavage site base pair plays a structural role in facilitating catalysis
RNA, September 1, 2008; 14(9): 1746 - 1760.
[Abstract] [Full Text] [PDF]


Home page
J. Virol.Home page
C. U. T. Hellen and S. de Breyne
A Distinct Group of Hepacivirus/Pestivirus-Like Internal Ribosomal Entry Sites in Members of Diverse Picornavirus Genera: Evidence for Modular Exchange of Functional Noncoding RNA Elements by Recombination
J. Virol., June 1, 2007; 81(11): 5850 - 5863.
[Abstract] [Full Text] [PDF]


Home page
RNAHome page
E. BINDEWALD and B. A. SHAPIRO
RNA secondary structure prediction from sequence alignments using a network of k-nearest neighbor classifiers.
RNA, March 1, 2006; 12(3): 342 - 352.
[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.