License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.10231.2
URN: urn:nbn:de:0030-drops-26892
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2010/2689/
|
Go to the corresponding Portal |
Bergeron, Anne ;
Mixtacki, Julia ;
Stoye, Jens
A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance
Abstract
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.
BibTeX - Entry
@InProceedings{bergeron_et_al:DagSemProc.10231.2,
author = {Bergeron, Anne and Mixtacki, Julia and Stoye, Jens},
title = {{A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance}},
booktitle = {Structure Discovery in Biology: Motifs, Networks \& Phylogenies},
pages = {1--25},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2010},
volume = {10231},
editor = {Alberto Apostolico and Andreas Dress and Laxmi Parida},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2010/2689},
URN = {urn:nbn:de:0030-drops-26892},
doi = {10.4230/DagSemProc.10231.2},
annote = {Keywords: Comparative genomics, genomic distance computation, HP theory}
}
|
Keywords: |
|
Comparative genomics, genomic distance computation, HP theory |
|
Collection: |
|
10231 - Structure Discovery in Biology: Motifs, Networks & Phylogenies |
|
Issue Date: |
|
2010 |
|
Date of publication: |
|
23.08.2010 |
