AliquotG: an improved heuristic algorithm for genome aliquoting.
An extant genome can be the descendant of an ancient polyploid genome.The genome aliquoting problem is to reconstruct the latter from the former such that the rearrangement distance (i.e., the number of genome rearrangements necessary to transform the former into the latter) is minimal.Though several heuristic algorithms have been published, here,