Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
156 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Reconstruction of time-consistent species trees (1910.13123v1)

Published 29 Oct 2019 in cs.DM, cs.DS, and math.CO

Abstract: The history of gene families -- which are equivalent to event-labeled gene trees -- can to some extent be reconstructed from empirically estimated evolutionary event-relations containing pairs of orthologous, paralogous or xenologous genes. The question then arises as whether inferred event-labeled gene trees are "biologically feasible" which is the case if one can find a species tree with which the gene tree can be reconciled in a time-consistent way. In this contribution, we consider event-labeled gene trees that contain speciation, duplication as well as horizontal gene transfer and we assume that the species tree is unknown. We provide a cubic-time algorithm to decide whether a "time-consistent" binary species for a given event-labeled gene tree exists and, in the affirmative case, to construct the species tree within the same time-complexity.

Citations (10)

Summary

We haven't generated a summary for this paper yet.