A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance
Bergeron A, Mixtacki J, Stoye J (2010)
In: Structure Discovery in Biology: Motifs, Networks & Phylogenies. Apostolico A, Dress A, Parida L, Schloss Dagstuhl, Leibniz-Zentrum für Informatik (Eds); Dagstuhl Seminar Proceedings, 10231. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany: Online-Ressource.
Kurzbeitrag Konferenz / Poster
| Veröffentlicht | Englisch
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
Autor*in
Bergeron, Anne;
Mixtacki, Julia;
Stoye, JensUniBi 
Herausgeber*in
Apostolico, Alberto;
Dress, Andreas;
Parida, Laxmi
herausgebende Körperschaft
Schloss Dagstuhl, Leibniz-Zentrum für Informatik
Einrichtung
Abstract / Bemerkung
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.
Stichworte
Comparative genomics;
genomic distance computation;
HP theory
Erscheinungsjahr
2010
Titel des Konferenzbandes
Structure Discovery in Biology: Motifs, Networks & Phylogenies
Serien- oder Zeitschriftentitel
Dagstuhl Seminar Proceedings
Band
10231
Seite(n)
Online-Ressource
ISBN
1862-4405
Page URI
https://pub.uni-bielefeld.de/record/2907492
Zitieren
Bergeron A, Mixtacki J, Stoye J. A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. In: Apostolico A, Dress A, Parida L, Schloss Dagstuhl, Leibniz-Zentrum für Informatik, eds. Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. Vol 10231. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany; 2010: Online-Ressource.
Bergeron, A., Mixtacki, J., & Stoye, J. (2010). A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. In A. Apostolico, A. Dress, L. Parida, & Schloss Dagstuhl, Leibniz-Zentrum für Informatik (Eds.), Dagstuhl Seminar Proceedings: Vol. 10231. Structure Discovery in Biology: Motifs, Networks & Phylogenies (pp. Online-Ressource). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. 2010. “A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance”. In Structure Discovery in Biology: Motifs, Networks & Phylogenies, ed. Alberto Apostolico, Andreas Dress, Laxmi Parida, and Schloss Dagstuhl, Leibniz-Zentrum für Informatik, 10231:Online-Ressource. Dagstuhl Seminar Proceedings. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
Bergeron, A., Mixtacki, J., and Stoye, J. (2010). “A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance” in Structure Discovery in Biology: Motifs, Networks & Phylogenies, Apostolico, A., Dress, A., Parida, L., and Schloss Dagstuhl, Leibniz-Zentrum für Informatik eds. Dagstuhl Seminar Proceedings, vol. 10231, (Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany), Online-Ressource.
Bergeron, A., Mixtacki, J., & Stoye, J., 2010. A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. In A. Apostolico, et al., eds. Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. no.10231 Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, pp. Online-Ressource.
A. Bergeron, J. Mixtacki, and J. Stoye, “A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance”, Structure Discovery in Biology: Motifs, Networks & Phylogenies, A. Apostolico, et al., eds., Dagstuhl Seminar Proceedings, vol. 10231, Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010, pp.Online-Ressource.
Bergeron, A., Mixtacki, J., Stoye, J.: A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance. In: Apostolico, A., Dress, A., Parida, L., and Schloss Dagstuhl, Leibniz-Zentrum für Informatik (eds.) Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. 10231, p. Online-Ressource. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, Dagstuhl, Germany (2010).
Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. “A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance”. Structure Discovery in Biology: Motifs, Networks & Phylogenies. Ed. Alberto Apostolico, Andreas Dress, Laxmi Parida, and Schloss Dagstuhl, Leibniz-Zentrum für Informatik. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010.Vol. 10231. Dagstuhl Seminar Proceedings. Online-Ressource.
Link(s) zu Volltext(en)
Access Level
Open Access
Material in PUB:
Spätere Version
A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance
Bergeron A, Mixtacki J, Stoye J (2009)
Theoretical Computer Science 410(51): 5300-5316.
Bergeron A, Mixtacki J, Stoye J (2009)
Theoretical Computer Science 410(51): 5300-5316.
Google Scholar
ISBN Suche