title: Genome aliquoting revisited.
abstract: We prove that the genome aliquoting problem, the problem of finding a recent polyploid ancestor of a genome, with breakpoint distance can be solved in polynomial time. We propose an aliquoting algorithm that is a 2-approximation for the genome aliquoting problem with double cut and join distance, improving upon the previous best solution to this problem, Feijão and Meidanis' 4-approximation algorithm.
authors: School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada.
authors: Robert
authors: R
authors: Warren
authors: David
authors: D
authors: Sankoff
mesh_terms: D000465:Algorithms; D003198:Computer Simulation; D018628:Gene Dosage; D020440:Gene Duplication; D016678:Genome; D008957:Models, Genetic; D010802:Phylogeny; D011003:Ploidies; D016615:Telomere / Q000235:genetics