An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
An algorithm for computing the connected components of the cycle graph of the given two signed genomes is studied, which is more efficient than the primary algorithm.
从边集合出发给出了计算有向基因组的圈图连通分支的线性时间算法。
应用推荐