论文标题
系统发育网络作为电阻距离的电路
Phylogenetic networks as circuits with resistance distance
论文作者
论文摘要
众所周知，系统发育网络很难重建。在这里，我们建议将沿系统发育网络中边缘的未知遗传距离视为与电路中未知的抗性相似的遗传距离。这种电阻距离在图理论中众所周知，事实证明具有不错的数学属性，可以精确地重建网络。具体而言，我们表明，加权1个网络的电阻距离是Kalmanson，而独特的相关圆形拆分网络完全表示原始系统发育网络（或电路）的分裂。实际上，这种完整的表示对应于平衡的最小进化多型网络的面孔。因此，未加权的原始网络类可以通过贪婪算法邻居网络或通过平衡的最小进化多层来重建。我们开始研究具有最小路径距离和电阻距离的2个嵌套网络，并包括2个纽片网络的一些计数结果。
Phylogenetic networks are notoriously difficult to reconstruct. Here we suggest that it can be useful to view unknown genetic distance along edges in phylogenetic networks as analogous to unknown resistance in electric circuits. This resistance distance, well known in graph theory, turns out to have nice mathematical properties which allow the precise reconstruction of networks. Specifically we show that the resistance distance for a weighted 1-nested network is Kalmanson, and that the unique associated circular split network fully represents the splits of the original phylogenetic network (or circuit). In fact, this full representation corresponds to a face of the balanced minimal evolution polytope for level-1 networks. Thus the unweighted class of the original network can be reconstructed by either the greedy algorithm neighbor-net or by linear programming over a balanced minimal evolution polytope. We begin study of 2-nested networks with both minimum path and resistance distance, and include some counting results for 2-nested networks.
