This paper deals with the problem of enumerating all minimum-cost LCA-reconciliations involving gene duplications and lateral gene transfers (LGTs) for a given species tree S and a given gene tree G. Previously, Tofigh et al. [20] gave a fixed-parameter algorithm for this problem that runs in O(m + 3k n) time, where m is the number of vertices in S, n is the number of vertices in G, and k is the minimum cost of an LCA-reconciliation between Sand G. In this paper, by refining their algorithm, we obtain a new one for the same problem that finds and outputs the solutions in a compact form within O(mn2 + 3k) time.
展开▼
机译:本文处理了一个问题,对于给定的物种树S和给定的基因树G,列举了涉及基因重复和横向基因转移(LGT)的所有最低成本的LCA和解。 [20]针对这个问题给出了一个固定参数算法,该算法在O(m + 3 k sup> n)时间中运行,其中m是S中的顶点数,n是G中的顶点数,并且k是Sand G之间进行LCA调节的最小成本。在本文中,通过改进他们的算法,我们针对相同的问题获得了一个新算法,该问题以O(mn 2 sup> + 3 k sup>)时间。
展开▼