Genome halving and double distance with losses.

Abstract excerpt

Given a phylogenetic tree involving whole genome duplication events, we contribute to solving the problem of computing the rearrangement and double cut-and-join (DCJ) distances on a branch of the tree linking a duplication node d to a speciation node or a leaf s. In the case of a genome G at s containing exactly two copies of each gene, the genome halving problem is to find a perfectly duplicated genome D at d...

Topics

Share this publication in a Topic to start or enrich a Post.

• Share to Genome
• Share to Ploidies
• Share to Algorithms