Deutsch
 
Benutzerhandbuch Datenschutzhinweis Impressum Kontakt
  DetailsucheBrowse

Datensatz

DATENSATZ AKTIONENEXPORT

Freigegeben

Zeitschriftenartikel

CESAR 2.0 substantially improves speed and accuracy of comparative gene annotation

MPG-Autoren
/persons/resource/persons191624

Sharma,  Virag
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

/persons/resource/persons198014

Schwede,  Peter
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

/persons/resource/persons184581

Hiller,  Michael
Max Planck Institute for the Physics of Complex Systems, Max Planck Society;

Volltexte (frei zugänglich)
Es sind keine frei zugänglichen Volltexte verfügbar
Ergänzendes Material (frei zugänglich)
Es sind keine frei zugänglichen Ergänzenden Materialien verfügbar
Zitation

Sharma, V., Schwede, P., & Hiller, M. (2017). CESAR 2.0 substantially improves speed and accuracy of comparative gene annotation. Bioinformatics, 33(24), 3985-3987. doi:10.1093/bioinformatics/btx527.


Zitierlink: http://hdl.handle.net/21.11116/0000-0000-819F-B
Zusammenfassung
Motivation: Homology-based gene prediction is a powerful concept to annotate newly sequenced genomes. We have previously demonstrated that whole genome alignments can be utilized for accurate comparative coding gene annotation. Results: Here we present CESAR 2.0 that utilizes genome alignments to transfer coding gene annotations from one reference to many other aligned genomes. We show that CESAR 2.0 is 77 times faster and requires 31 times less memory compared to its predecessor. CESAR 2.0 substantially improves the ability to align splice sites that have shifted over larger distances, allowing for precise identification of the exon boundaries in the aligned genome. Finally, CESAR 2.0 supports entire genes, which enables the annotation of joined exons that arose by complete intron deletions. CESAR 2.0 can readily be applied to new genome alignments to annotate coding genes in many other genomes at improved accuracy and without necessitating large-computational resources.