Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published February 2007 | Published
Journal Article Open

Improving the Caenorhabditis elegans Genome Annotation Using Machine Learning

Abstract

For modern biology, precise genome annotations are of prime importance, as they allow the accurate definition of genic regions. We employ state-of-the-art machine learning methods to assay and improve the accuracy of the genome annotation of the nematode Caenorhabditis elegans. The proposed machine learning system is trained to recognize exons and introns on the unspliced mRNA, utilizing recent advances in support vector machines and label sequence learning. In 87% (coding and untranslated regions) and 95% (coding regions only) of all genes tested in several out-of-sample evaluations, our method correctly identified all exons and introns. Notably, only 37% and 50%, respectively, of the presently unconfirmed genes in the C. elegans genome annotation agree with our predictions, thus we hypothesize that a sizable fraction of those genes are not correctly annotated. A retrospective evaluation of the Wormbase WS120 annotation [1] of C. elegans reveals that splice form predictions on unconfirmed genes in WS120 are inaccurate in about 18% of the considered cases, while our predictions deviate from the truth only in 10%–13%. We experimentally analyzed 20 controversial genes on which our system and the annotation disagree, confirming the superiority of our predictions. While our method correctly predicted 75% of those cases, the standard annotation was never completely correct. The accuracy of our system is further corroborated by a comparison with two other recently proposed systems that can be used for splice form prediction: SNAP and ExonHunter. We conclude that the genome annotation of C. elegans and other organisms can be greatly enhanced using modern machine learning technology.

Additional Information

© 2007 Rätsch et al. This is an open-access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited. Received: February 2, 2006; Accepted: December 20, 2006; Published: February 23, 2007. Funding. This work was supported in part by the IST Programme of the European Community, under the PASCAL Network of Excellence, IST-2002–506778. Partial funding from the German Research Foundation (MU 987/2–1) is appreciated. Competing interests. GR, SS, KRM, and BS are authors of a patent application (PCT WO05116246) related to the technical innovations of the proposed method. Editor: Uwe Ohler, Duke University, United States of America. We gratefully acknowledge inspiring discussions with Anja Neuber, Alexander Zien, Andrei Lupas, Detlef Weigel, Alan Zahler, Koji Tsuda, Christina Leslie, Eleazar Eskin, and Ivo Grosse. Alexander Zien additionally helped with the implementation of the POIMs. We thank Christoph Dieterich for providing access to a draft assembly of the P. pacificus genome. Additionally, we thank Broňa Brejová, Tomáš Vinař, and Ian Korf for their collaboration to conduct the comparisons with ExonHunter and SNAP. Furthermore, we would like to thank Anthony Rogers and Todd Harris for their help to get the new annotation onto the Wormbase Web site. Author contributions. GR, SS, JS, KRM, RJS, and BS conceived and designed the experiments. GR, JS, and HW performed the experiments. GR and SS analyzed the data. SS, RJS, and BS contributed reagents/materials/analysis tools. GR, JS, KRM, RJS, and BS wrote the paper. SS and JS contributed equally to the paper. Supporting Information: Protocol S1. Data Preparation Protocols, Additional Results, and Primer Lists

Attached Files

Published - RATploscb07.pdf

Published - RATploscb07protocols1.pdf

Files

RATploscb07.pdf
Files (3.4 MB)
Name Size Download all
md5:a6791481c6b95637355a9cde9875185f
3.2 MB Preview Download
md5:1f3eaa79de741d05d0457b6019d44d00
165.3 kB Preview Download

Additional details

Created:
August 22, 2023
Modified:
October 16, 2023