Phylogenomics with Paralogs

Abstract

Phylogenomics heavily relies on well-curated sequence data sets that consist, for each gene, exclusively of 1:1-orthologous. Paralogs are treated as a dangerous nuisance that has to be detected and removed. We show here that this severe restriction of the data sets is not necessary. Building upon recent advances in mathematical phylogenetics we demonstrate that gene duplications convey meaningful phylogenetic information and allow the inference of plausible phylogenetic trees, provided orthologs and paralogs can be distinguished with a degree of certainty. Starting from tree-free estimates of orthology, cograph editing can sufficiently reduce the noise in order to find correct event-annotated gene trees. The information of gene trees can then directly be translated into constraints on the species trees. While the resolution is very poor for individual gene families, we show that genome-wide data sets are sufficient to generate fully resolved phylogenetic trees, even in the presence of horizontal gene transfer. We demonstrate that the distribution of paralogs in large gene families contains in itself sufficient phylogenetic signal to infer fully resolved species phylogenies. This source of phylogenetic information is independent of information contained in orthologous sequences and is resilient against horizontal gene transfer. An important consequence is that phylogenomics data sets need not be restricted to 1:1 orthologs.

Cited by in corpus (17)

• Best Match Graphs
• Alternative Characterizations of Fitch's Xenology Relation
• The Matroid Structure of Representative Triple Sets and Triple-Closure Computation
• Forbidden Time Travel: Characterization of Time-Consistent Tree Reconciliation Maps
• Generalized Fitch Graphs II: Sets of Binary Relations that are explained by Edge-labeled Trees
• Destroying Bicolored $P_3$s by Deleting Few Edges
• Construction of Gene and Species Trees from Sequence Data incl. Orthologs, Paralogs, and Xenologs
• Exact and heuristic algorithms for Cograph Editing
• Consistency of orthology and paralogy constraints in the presence of gene transfers
• The Mathematics of Xenology: Di-cographs, Symbolic Ultrametrics, 2-structures and Tree-representable Systems of Binary Relations
• Biologically Feasible Gene Trees, Reconciliation Maps and Informative Triples
• Constructing a Consensus Phylogeny from a Leaf-Removal Distance
• Cograph Editing: Merging Modules is equivalent to Editing P4's
• Inference of Phylogenetic Trees from the Knowledge of Rare Evolutionary Events
• Phylogenetic trees and homomorphisms
• From event labeled gene trees to species trees
• Spiders can be recognized by counting their legs