Send to:

Choose Destination
See comment in PubMed Commons below
J Comput Biol. 2011 Sep;18(9):1065-75. doi: 10.1089/cmb.2011.0087.

Genome aliquoting revisited.

Author information

  • 1School of Information Technology and Engineering, University of Ottawa, Ottawa, Canada.


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.

[PubMed - indexed for MEDLINE]
PubMed Commons home

PubMed Commons

How to join PubMed Commons

    Supplemental Content

    Full text links

    Icon for Mary Ann Liebert, Inc.
    Loading ...
    Write to the Help Desk