Best Matches in Phylogenetic Networks

2026-09-18

AI Summary

研究解决了在叶色根网络中识别最佳匹配图（BMGs）的问题，通过定义sicor-in-hub属性，并提出线性时间识别算法和二次时间构建解释网络的方法。

Abstract

Best match graphs (BMGs) were introduced in mathematical phylogenetics to describe the concept of closest relatives for related genes (leaves of rooted tree) in different organisms (defining leaf colors). We generalize this concept here to leaf-colored rooted networks, where least common ancestors are in general neither unique nor comparable. We characterize BMGs of rooted networks as those vertex-colored digraphs that are properly colored and satisfy an easy-to-check condition that we call the sicor-in-hub property. BMGs can be recognized in linear time and an explaining network can be constructed in quadratic time. Analogous results are obtained for reciprocal best match graphs (RBMGs), where an edge $\{x,y\}$ corresponds to pairs of vertices with different color that are mutually closest relatives.

Problem

• Best Match Graphs
• Rooted Networks
• Leaf-colored
• Sicor-in-hub Property
• Reciprocal Best Match Graphs

Innovation

• phylogenetic networks
• best match graphs (BMGs)
• sicor-in-hub property
• reciprocal best match graphs (RBMGs)