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.

Download
Es wurde kein Volltext hochgeladen. Nur Publikationsnachweis!
Zeitschriftenaufsatz | Veröffentlicht | Englisch
Autor
; ;
Erscheinungsjahr
Zeitschriftentitel
Theoretical Computer Science
Band
410
Zeitschriftennummer
51
Seite
5300-5316
ISSN
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. Theoretical Computer Science. 2009;410(51):5300-5316.
Bergeron, A., Mixtacki, J., & Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science, 410(51), 5300-5316. doi:10.1016/j.tcs.2009.09.008
Bergeron, A., Mixtacki, J., and Stoye, J. (2009). A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science 410, 5300-5316.
Bergeron, A., Mixtacki, J., & Stoye, J., 2009. A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science, 410(51), p 5300-5316.
A. Bergeron, J. Mixtacki, and J. Stoye, “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”, Theoretical Computer Science, vol. 410, 2009, pp. 5300-5316.
Bergeron, A., Mixtacki, J., Stoye, J.: A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance. Theoretical Computer Science. 410, 5300-5316 (2009).
Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. “A New Linear Time Algorithm to Compute the Genomic Distance via the Double Cut and Join Distance”. Theoretical Computer Science 410.51 (2009): 5300-5316.
Material in PUB:
Frühere Version
Computing the Genomic Distance in Linear Time
Bergeron A, Mixtacki J, Stoye J (2010)
In: Dagstuhl Seminar Proceedings: 10231 Abstracts Collection : Structure Discovery in Biology: Motifs, Networks & Phylogenies. Apostolico A, Dress A, Parida L (Eds); , 10231. Dagstuhl: Schloss Dagstuhl - Leibniz-Zentrum für Informatik: 18.