Least resolved trees for two-colored best match graphs

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 O(|V | + |E| log |V |)-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.

[1]  Dulce I. Valdivia,et al.  Corrigendum to “Best match graphs” , 2021, Journal of Mathematical Biology.

[2]  Timothy J. Purcell.  Sorting and searching , 2005, SIGGRAPH Courses.

[3]  Mikkel Thorup,et al.  Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity , 2001, JACM.

[4]  Shimon Even,et al.  An On-Line Edge-Deletion Problem , 1981, JACM.

[5]  G. Abrams,et al.  The Graph Menagerie: Abstract Algebra and the Mad Veterinarian , 2010 .

[6]  Peter F. Stadler,et al.  Best Match Graphs with Binary Trees , 2020, AlCoB.

[7]  Xin-She Yang,et al.  Introduction to Algorithms , 2021, Nature-Inspired Optimization Algorithms.

[8]  P. Alam.  ‘K’ , 2021, Composites Engineering.

[9]  Robin Pemantle,et al.  Generating a Random Sink-free Orientation in Quadratic Time , 2002, Electron. J. Comb..

[10]  Alfred V. Aho,et al.  Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions , 1981, SIAM J. Comput..

[11]  W. Hager,et al.  and s , 2019, Shallow Water Hydraulics.

[12]  Dulce I. Valdivia,et al.  Best match graphs , 2019, Journal of Mathematical Biology.

[13]  T. Turner.  Phylogenetics , 2018, The International Encyclopedia of Biological Anthropology.

[14]  Peter F. Stadler,et al.  Complexity of Modification Problems for Best Match Graphs , 2020, Theor. Comput. Sci..

[15]  Sandip Das,et al.  Oriented Bipartite Graphs and the Goldbach Graph , 2016, Discret. Math..

[16]  Peter F. Stadler,et al.  Complete Characterization of Incorrect Orthology Assignments in Best Match Graphs , 2020, ArXiv.

[17]  Aric Hagberg,et al.  Exploring Network Structure, Dynamics, and Function using NetworkX , 2008, Proceedings of the Python in Science Conference.

[18]  David Thomas,et al.  The Art in Computer Programming , 2001 .

[19]  Annachiara Korchmaros.  The structure of 2-colored best match graphs , 2021, Discret. Appl. Math..

[20]  A. Korchmaros.  Circles and Paths in 2-Colored Best Match Graphs. , 2020, 2006.04100.