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^2|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.
翻译：2色最佳匹配图表(2-BMGs)形成一个无汇双透明图的亚类,出现在植物遗传组合体中。 其中, 2-BMgs描述的是一对物种之间在进化上最密切相关的基因。 它们用一棵独特且分辨率最低的树解释 。 引入支持顶点概念时, 我们得出一个$O( ⁇ ⁇ Eç ⁇ log ⁇ 2 ⁇ ⁇ ⁇ ⁇ ) 的时值算法, 以识别2- BMgs 并构建其 LRT 。 这种方法还可以推广到同样复杂的二进制2 BMgs 。 实验性比较强调新算法的效率 。
相关内容
微信扫码咨询专知VIP会员