Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
Keyword(s):
A Priori
◽
Best match graphs (BMGs) are vertex-colored digraphs that naturally arise in mathematical phylogenetics to formalize the notion of evolutionary closest genes w.r.t. an a priori unknown phylogenetic tree. BMGs are explained by unique least resolved trees. We prove that the property of a rooted, leaf-colored tree to be least resolved for some BMG is preserved by the contraction of inner edges. For the special case of two-colored BMGs, this leads to a characterization of the least resolved trees (LRTs) of binary-explainable trees and a simple, polynomial-time algorithm for the minimum cardinality completion of the arc set of a BMG to reach a BMG that can be explained by a binary tree.
1994 ◽
Vol 03
(03)
◽
pp. 395-405
1992 ◽
Vol 02
(04)
◽
pp. 383-416
◽
2015 ◽
Vol 14
(05)
◽
pp. 1111-1128
◽
2009 ◽
Vol 01
(02)
◽
pp. 253-265
◽
2004 ◽
Vol 02
(01)
◽
pp. 173-213
◽
Keyword(s):
2020 ◽
Vol 12
(05)
◽
pp. 2050057