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 (Eds); Dagstuhl Seminar Proceedings, 10231. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Kurzbeitrag Konferenz / Poster | Veröffentlicht | Englisch
Autor
; ;
Herausgeber
; ;
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.
Erscheinungsjahr
Titel des Konferenzbandes
Structure Discovery in Biology: Motifs, Networks & Phylogenies
Band
10231
ISBN
PUB-ID

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, eds. Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. Vol 10231. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany; 2010.
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 (Eds.), Dagstuhl Seminar Proceedings: Vol. 10231. Structure Discovery in Biology: Motifs, Networks & Phylogenies 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., and Parida, L. eds. Dagstuhl Seminar Proceedings, vol. 10231, (Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany).
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, eds. Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. no.10231 Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany.
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, A. Dress, and L. Parida, eds., Dagstuhl Seminar Proceedings, vol. 10231, Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010.
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., and Parida, L. (eds.) Structure Discovery in Biology: Motifs, Networks & Phylogenies. Dagstuhl Seminar Proceedings. 10231, 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, and Laxmi Parida. Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany, 2010.Vol. 10231. Dagstuhl Seminar Proceedings.
Link(s) zu Volltext(en)
Access Level
Restricted Closed 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.

Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Suchen in

Google Scholar
ISBN Suche