腔匹配、标号互补和无根进化树
Cavity Matchings, Label Compressions, and Unrooted Evolutionary Trees
摘要：
我们提出了一个算法计算两个无根进化树的最大协议子树。对于度为无界的树，它需要O（n^{1.5} log n）时间，与已知的最好的有根树的时间复杂度相匹配。我们的算法允许输入树是混合树，即，可以同时包含有向边和无向边的树。我们的算法采用了递归策略，利用一种称为标签压缩的技术。这种技术的核心是一种算法，它可以像计算单个匹配一样快地计算二分图的许多子图上的最大权重匹配。
英文摘要：
We present an algorithm for computing a maximum agreement subtree of two unrooted evolutionary trees. It takes O(n^{1.5} log n) time for trees with unbounded degrees, matching the best known time complexity for the rooted case. Our algorithm allows the input trees to be mixed trees, i.e., trees that may contain directed and undirected edges at the same time. Our algorithm adopts a recursive strategy exploiting a technique called label compression. The backbone of this technique is an algorithm that computes the maximum weight matchings over many subgraphs of a bipartite graph as fast as it takes to compute a single matching.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
