Skip Navigation

Nucleic Acids Research 2004 32(Web Server Issue):W142-W145; doi:10.1093/nar/gkh415
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (255K) 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 Touzet, H.
Right arrow Articles by Perriquet, O.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Touzet, H.
Right arrow Articles by Perriquet, O.
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

CARNAC: folding families of related RNAs

Hélène Touzet* and Olivier Perriquet

Laboratoire d'Informatique Fondamentale de Lille, UMR CNRS 8022, Université des Sciences et Technologies de Lille, France

* To whom correspondence should be addressed. Tel: +33 3 20 43 68 02; Fax: +33 3 20 43 65 66; Email: touzet{at}lifl.fr

Received February 13, 2004; Revised and Accepted April 2, 2004

We present a tool for the prediction of conserved secondary structure elements of a family of homologous non-coding RNAs. Our method does not require any prior multiple sequence alignment. Thus, it successfully applies to datasets with low primary structure similarity. The functionality is demonstrated using three example datasets: sequences of RNase P RNAs, ciliate telomerases and enterovirus messenger RNAs. CARNAC has a web server that can be accessed at the URL http://bioinfo.lifl.fr/carnac.


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. Biol. Chem.Home page
K. L. Murphy, X. Zhang, R. R. Gainetdinov, J.-M. Beaulieu, and M. G. Caron
A Regulatory Domain in the N Terminus of Tryptophan Hydroxylase 2 Controls Enzyme Expression
J. Biol. Chem., May 9, 2008; 283(19): 13216 - 13224.
[Abstract] [Full Text] [PDF]


Home page
Brief BioinformHome page
I. M. Meyer
A practical guide to the art of RNA gene prediction
Brief Bioinform, November 1, 2007; 8(6): 396 - 414.
[Abstract] [Full Text] [PDF]


Home page
Proc. Natl. Acad. Sci. USAHome page
S.-J. Hong, F. H. Lessner, E. M. Mahen, and K. C. Keiler
Proteomic identification of tmRNA substrates
PNAS, October 23, 2007; 104(43): 17128 - 17133.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
X. Xu, Y. Ji, and G. D. Stormo
RNA Sampler: a new sampling based algorithm for common RNA secondary structure prediction and structural alignment
Bioinformatics, August 1, 2007; 23(15): 1883 - 1891.
[Abstract] [Full Text] [PDF]


Home page
Nucleic Acids ResHome page
B. Voss
Structural analysis of aligned RNAs
Nucleic Acids Res., November 14, 2006; 34(19): 5471 - 5481.
[Abstract] [Full Text] [PDF]


Home page
BioinformaticsHome page
Z. Yao, Z. Weinberg, and W. L. Ruzzo
CMfinder--a covariance model based RNA motif finding algorithm
Bioinformatics, February 15, 2006; 22(4): 445 - 452.
[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.