Abstract
Genome median and halving problems aim at reconstructing ancestral genomes and the evolutionary events leading from the ancestor to extant species. The NP-hardness of the breakpoint distance and reversal distance median problems for unichromosomal genomes do not easily imply the same for the multichromosomal case. Here we find the complexity of several genome median and halving problems, including a surprising polynomial result for the breakpoint median and guided halving problems in genomes with circular and linear chromosomes; the multichromosomal problem is thus easier than the unichromosomal one. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Tannier, E., Zheng, C., & Sankoff, D. (2008). Multichromosomal genome median and halving problems. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5251 LNBI, pp. 1–13). https://doi.org/10.1007/978-3-540-87361-7_1
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
