Least resolved trees for two-colored best match graphs
Populations and Evolution
2021-01-19 v1 Computational Complexity
Discrete Mathematics
Combinatorics
Abstract
2-colored best match graphs (2-BMGs) form a subclass of sink-free bi-transitive graphs that appears in phylogenetic combinatorics. There, 2-BMGs describe evolutionarily most closely related genes between a pair of species. They are explained by a unique least resolved tree (LRT). Introducing the concept of support vertices we derive an -time algorithm to recognize 2-BMGs and to construct its LRT. The approach can be extended to also recognize binary-explainable 2-BMGs with the same complexity. An empirical comparison emphasizes the efficiency of the new algorithm.
Keywords
Cite
@article{arxiv.2101.07000,
title = {Least resolved trees for two-colored best match graphs},
author = {David Schaller and Manuela Geiß and Marc Hellmuth and Peter F. Stadler},
journal= {arXiv preprint arXiv:2101.07000},
year = {2021}
}