eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2010-08-23
1
25
10.4230/DagSemProc.10231.2
article
A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance
Bergeron, Anne
Mixtacki, Julia
Stoye, Jens
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.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol10231/DagSemProc.10231.2/DagSemProc.10231.2.pdf
Comparative genomics
genomic distance computation
HP theory