A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance
The genomic distance problem in the Hannenhalli-Pevzner (HP) theory is the following: Given two genomes whose chromosomes are linear, calculate the minimum number of translocations, fusions, fissions and inversions that transform one genome into the other. We will present a new distance formula based on a simple tree structure that captures all the delicate features of this problem in a unifying way, and a linear-time algorithm for computing this distance.
Comparative genomics
genomic distance computation
HP theory
1-25
Regular Paper
Anne
Bergeron
Anne Bergeron
Julia
Mixtacki
Julia Mixtacki
Jens
Stoye
Jens Stoye
10.4230/DagSemProc.10231.2
Creative Commons Attribution 4.0 International license
https://creativecommons.org/licenses/by/4.0/legalcode