Gentrius: Generating Trees Compatible With a Set of Unrooted Subtrees and its Application to Phylogenetic Terraces

• DOI: 10.1093/molbev/msae219
• Publication Date: 2024-10-21T11:18:31Z
• Authors: Olga Chernomor; Christiane Elgert; Arndt von Haeseler
• Keywords: Tree (set theory); Tree rearrangement; Data set

Abstract For a set of binary unrooted subtrees generating all trees compatible with them, i.e. their stand, is one the classical problems in phylogenetics. Here, we introduce Gentrius – an efficient algorithm to tackle this task. The has direct application practice. Namely, generates phylogenetic terraces - topologically distinct, equally scoring due missing data. Despite stand generation being computationally intractable, showed on simulated and biological datasets that stands millions feasible time. We exemplify depending distribution data across species loci inferred phylogeny, number optimal terrace varies tremendously. strict consensus tree computed from them displays branches unaffected by pattern Thus, solving problem generation, practice provides important systematic assessment incomplete Furthermore, can aid theoretical research fostering understanding space structure imposed