Relative Timing Information and Orthology in Evolutionary Scenarios

12/05/2022
by   David Schaller, et al.
0

Evolutionary scenarios describing the evolution of a family of genes within a collection of species comprise the mapping of the vertices of a gene tree T to vertices and edges of a species tree S. The relative timing of the last common ancestors of two extant genes (leaves of T) and the last common ancestors of the two species (leaves of S) in which they reside is indicative of horizontal gene transfers (HGT) and ancient duplications. Orthologous gene pairs, on the other hand, require that their last common ancestors coincides with a corresponding speciation event. The relative timing information of gene and species divergences is captured by three colored graphs that have the extant genes as vertices and the species in which the genes are found as vertex colors: the equal-divergence-time (EDT) graph, the later-divergence-time (LDT) graph and the prior-divergence-time (PDT) graph, which together form an edge partition of the complete graph. Here we give a complete characterization in terms of informative and forbidden triples that can be read off the three graphs and provide a polynomial time algorithm for constructing an evolutionary scenario that explains the graphs, provided such a scenario exists. While both LDT and PDT graphs are cographs, this is not true for the EDT graph in general. We show that every EDT graph is perfect. While the information about LDT and PDT graphs is necessary to recognize EDT graphs in polynomial-time for general scenarios, this extra information can be dropped in the HGT-free case. However, recognition of EDT graphs without knowledge of putative LDT and PDT graphs is NP-complete for general scenarios. We finally connect the EDT graph to the alternative definitions of orthology that have been proposed for scenarios with horizontal gene transfer. With one exception, the corresponding graphs are shown to be colored cographs.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
12/16/2020

Indirect Identification of Horizontal Gene Transfer

Several implicit methods to infer Horizontal Gene Transfer (HGT) focus o...
research
05/13/2019

Counting and sampling gene family evolutionary histories in the duplication-loss and duplication-loss-transfer models

Given a set of species whose evolution is represented by a species tree,...
research
02/22/2022

A QUBO formulation for the Tree Containment problem

Phylogenetic (evolutionary) trees and networks are leaf-labeled graphs t...
research
06/03/2020

Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs

Genome-scale orthology assignments are usually based on reciprocal best ...
research
06/12/2023

Fitch Graph Completion

Horizontal gene transfer is an important contributor to evolution. Accor...
research
06/30/2020

Complexity of Modification Problems for Best Match Graphs

Best match graphs (BMGs) are vertex-colored directed graphs that were in...

Please sign up or login with your details

Forgot password? Click here to reset