Abstract
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 accuracy. Our method also provides insights into the combinatorial structure of genome transformations with respect to appearance of circular chromosomes. © 2014 Springer-Verlag Berlin Heidelberg.
Author supplied keywords
Cite
CITATION STYLE
Jiang, S., & Alekseyev, M. A. (2014). Linearization of median genomes under DCJ. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 8701 LNBI, pp. 97–106). Springer Verlag. https://doi.org/10.1007/978-3-662-44753-6_8
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
