Avdeyev Pavel, Jiang Shuai, Alekseyev Max A
Computational Biology Institute, The George Washington University, Washington, DC, USA.
Department of Computer Science and Engineering, University of South Carolina, Columbia, SC, USA.
Evol Bioinform Online. 2019 Jun 6;15:1176934318820534. doi: 10.1177/1176934318820534. eCollection 2019.
Reconstruction of the median genome consisting of linear chromosomes from three given genomes is known to be intractable. There exist efficient methods for solving a relaxed version of this problem, where the median genome is allowed to have circular chromosomes. We propose a method for construction of an approximate solution to the original problem from a solution to the relaxed problem and prove a bound on its approximation error. Our method also provides insights into the combinatorial structure of genome transformations with respect to appearance of circular chromosomes.
已知从三个给定基因组重建由线性染色体组成的中位数基因组是难以处理的。存在解决该问题松弛版本的有效方法,其中允许中位数基因组具有环状染色体。我们提出了一种从松弛问题的解构建原始问题近似解的方法,并证明了其近似误差的界限。我们的方法还提供了关于基因组转换相对于环状染色体出现的组合结构的见解。