Paper Info
Title
A linear time algorithm for error-corrected reconciliation of unrooted gene trees
Abstract
Evolutionary methods are increasingly challenged by the fast growing resources of genomic sequence information. Fundamental evolutionary events, like gene duplication, loss, and deep coalescence, account more then ever for incongruence between gene trees and the actual species tree. Gene tree reconciliation is addressing this fundamental problem by invoking the minimum number of gene-duplication and losses that reconcile a gene tree with a species tree. Despite its promise, gene tree reconciliation assumes the gene trees to be correctly rooted and free of error, which severely limits its application in practice. Here we present a novel linear time algorithm for error-corrected gene tree reconciliation of unrooted gene trees. Furthermore, in an empirical study on yeast genomes we successfully demonstrate the ability of our algorithm to (i) reconcile (cure) errorprone gene trees, and (ii) to improve on more advanced evolutionary applications that are based on gene tree reconciliation.
Year
DOI
Venue
2011
10.1007/978-3-642-21260-4_17
ISBRA
Keywords
Field
DocType
actual species tree,gene tree reconciliation,linear time algorithm,species tree,error-corrected gene tree reconciliation,advanced evolutionary application,errorprone gene tree,fundamental evolutionary event,unrooted gene tree,gene tree,error-corrected reconciliation,gene duplication,empirical study,error correction,genome sequence
Genome,Gene,Phylogenetic tree,Tree rearrangement,Computer science,Algorithm,Bioinformatics,Time complexity,Gene duplication
Conference
Volume
ISSN
Citations 
6674
0302-9743
15
PageRank 
References 
Authors
0.70
16
2
Name
Order
Citations
PageRank
Paweł Górecki11105.71
Oliver Eulenstein250552.71