title: MGC: a metagenomic gene caller.
abstract: BACKGROUND
  Computational gene finding algorithms have proven their robustness in identifying genes in complete genomes. However, metagenomic sequencing has presented new challenges due to the incomplete and fragmented nature of the data. During the last few years, attempts have been made to extract complete and incomplete open reading frames (ORFs) directly from short reads and identify the coding ORFs, bypassing other challenging tasks such as the assembly of the metagenome.
  
  
  RESULTS
  In this paper we introduce a metagenomics gene caller (MGC) which is an improvement over the state-of-the-art prediction algorithm Orphelia. Orphelia uses a two-stage machine learning approach and computes a model that classifies extracted ORFs from fragmented sequences. We hypothesise and demonstrate evidence that sequences need separate models based on their local GC-content in order to avoid the noise introduced to a single model computed with sequences from the entire GC spectrum. We have also added two amino-acid features based on the benefit of amino-acid usage shown in our previous research. Our algorithm is able to predict genes and translation initiation sites (TIS) more accurately than Orphelia which uses a single model.
  
  
  CONCLUSIONS
  Learning separate models for several pre-defined GC-content regions as opposed to a single model approach improves the performance of the neural network as demonstrated by the experimental results presented in this paper. The inclusion of amino-acid usage features also helps improve the overall accuracy of our algorithm. MGC's improvement sets the ground for further investigation into the use of GC-content to separate data for training models in machine learning based gene finders.
authors.affiliation: Department of Computer Science and Engineering, University of South Carolina, 315 Main Street, Columbia, SC 29208, USA. eachraf@gmail.com
authors.forename: Achraf
authors.initials: A
authors.lastname: El Allali
authors.forename: John R
authors.initials: JR
authors.lastname: Rose
mesh_terms: D000465:Algorithms; D001482:Base Composition; D001483:Base Sequence; D003062:Codon; D019295:Computational Biology / Q000379:methods*; D020745:Genome, Archaeal; D016680:Genome, Bacterial; D056186:Metagenomics / Q000379:methods*; D016571:Neural Networks, Computer; D016366:Open Reading Frames
chemical_list: D003062:Codon
references.citation: J Mol Evol. 1996 Sep;43(3):216-23
references.pmid: 8703087
references.citation: Nucleic Acids Res. 2009 Jul;37(Web Server issue):W101-5
references.pmid: 19429689
references.citation: Mol Biol Evol. 2000 Nov;17(11):1581-8
references.pmid: 11070046
references.citation: PLoS One. 2011 Mar 10;6(3):e17677
references.pmid: 21423704
references.citation: J Mol Biol. 1995 Aug 18;251(3):390-9
references.pmid: 7650738
references.citation: BMC Res Notes. 2011 Jan 27;4:20
references.pmid: 21272306
references.citation: Microb Inform Exp. 2012 Feb 09;2(1):3
references.pmid: 22587947
references.citation: Biotechnology (N Y). 1996 Jan;14(1):61-5
references.pmid: 9636313
references.citation: Nucleic Acids Res. 2010 Nov;38(20):e191
references.pmid: 20805240
references.citation: Nucleic Acids Res. 2006;34(19):5623-30
references.pmid: 17028096
references.citation: BMC Bioinformatics. 2008 Apr 28;9:217
references.pmid: 18442389
references.citation: Genome Res. 2008 Feb;18(2):324-30
references.pmid: 18083777
references.citation: Protein Eng. 1990 Dec;4(2):155-61
references.pmid: 2075190
references.citation: J Mol Evol. 2003 Oct;57(4):453-66
references.pmid: 14708578
references.citation: Nucleic Acids Res. 2004 Jan 1;32(Database issue):D23-6
references.pmid: 14681350
references.citation: Genome Res. 2008 May;18(5):810-20
references.pmid: 18340039
references.citation: Curr Protoc Bioinformatics. 2003 May;Chapter 4:Unit4.5
references.pmid: 18428700