Skip Navigation


Nucleic Acids Research Advance Access originally published online on June 3, 2009
Nucleic Acids Research 2009 37(Web Server issue):W312-W316; doi:10.1093/nar/gkp479
This Article
Right arrow Full Text Freely available
Right arrow Print PDF (146K) Freely available
Right arrow Screen PDF (156K) Freely available
Right arrowOA All Versions of this Article:
37/suppl_2/W312    most recent
gkp479v1
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 Schweikert, G.
Right arrow Articles by Rätsch, G.
PubMed
Right arrow PubMed Citation
Right arrow Articles by Schweikert, G.
Right arrow Articles by Rätsch, G.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Nucleic Acids Research, 2009, Vol. 37, No. suppl_2 W312-W316
© 2009 The Author(s)
This is an Open Access article distributed under the terms of the Creative Commons Attribution Non-Commercial License (http://creativecommons.org/licenses/by-nc/2.0/uk/) which permits unrestricted non-commercial use, distribution, and reproduction in any medium, provided the original work is properly cited.


Articles

mGene.web: a web service for accurate computational gene finding

Gabriele Schweikert1,2,3, Jonas Behr1, Alexander Zien1,4, Georg Zeller1,3, Cheng Soon Ong1,2, Sören Sonnenburg1 and Gunnar Rätsch1,*

1Friedrich Miescher Laboratory, Max Planck Society, 2Department for Empirical Inference, Max Planck Institute for Biological Cybernetics, 3Department for Molecular Biology, Max Planck Institute for Developmental Biology Tübingen, Germany and 4Department for Intelligent Data Analysis, Fraunhofer Institute FIRST, Berlin, Germany

*To whom correspondence should be addressed. Tel: +49 7071 601 820; Fax: +49 7071 601 801; Email: gunnar.raetsch{at}tuebingen.mpg.de

Received March 5, 2009. Revised May 7, 2009. Accepted May 17, 2009.

We describe mGene.web, a web service for the genome-wide prediction of protein coding genes from eukaryotic DNA sequences. It offers pre-trained models for the recognition of gene structures including untranslated regions in an increasing number of organisms. With mGene.web, users have the additional possibility to train the system with their own data for other organisms on the push of a button, a functionality that will greatly accelerate the annotation of newly sequenced genomes. The system is built in a highly modular way, such that individual components of the framework, like the promoter prediction tool or the splice site predictor, can be used autonomously. The underlying gene finding system mGene is based on discriminative machine learning techniques and its high accuracy has been demonstrated in an international competition on nematode genomes. mGene.web is available at http://www.mgene.org/web, it is free of charge and can be used for eukaryotic genomes of small to moderate size (several hundred Mbp).


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
Genome ResHome page
G. Schweikert, A. Zien, G. Zeller, J. Behr, C. Dieterich, C. S. Ong, P. Philips, F. De Bona, L. Hartmann, A. Bohlen, et al.
mGene: Accurate SVM-based gene finding with an application to nematode genomes
Genome Res., November 1, 2009; 19(11): 2133 - 2143.
[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.