Computational methods for the identification of genes in vertebrate genomic sequences.
Research into new methods to identify genes in anonymous genomic sequences has been going on for more than 15 years. Over this period of time, the field has evolved from the designing of programs to identify protein coding regions in compact mitochondrial or bacterial genomes, to the challenge of predicting the detailed organization of multi-exon vertebrate genes. The best program currently available perfectly locates more than 80% of the internal coding exons, and only 5% of the predictions do not overlap a real exon. Given such accuracy, computational methods are indeed very useful; however, they do not alleviate the need for experimental validation. If the performances are satisfactory for the identification of the coding moiety of genes (internal coding exons), the determination of the full extent of the transcript (5' and 3' extremities of the gene) and the location of promoter regions are still unreliable. As the human and mouse genome sequencing projects enter a production mode, the fully automated annotation of megabase-long anonymous genomic sequences is the next big challenge in bioinformatics.
Claverie
J M
JM
Structural and Genetic Information Laboratory, CNRS-EP.91, Marseille, France. jmc@igs.cnrs-mrs.fr
D000818:Animals; D001483:Base Sequence; D002874:Chromosome Mapping; D004272:DNA, Mitochondrial; D005091:Exons; D016678:Genome; D016680:Genome, Bacterial; D015894:Genome, Human; D016045:Human Genome Project; D006801:Humans; D007256:Information Systems; D051379:Mice; D008969:Molecular Sequence Data; D015203:Reproducibility of Results; D014714:Vertebrates / Q000235:genetics*
D004272:DNA, Mitochondrial