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.

Zeitschriftenaufsatz | Veröffentlicht | Englisch
 
Download
Es wurden keine Dateien hochgeladen. Nur Publikationsnachweis!
DOI
Autor*in
Bergeron, Anne; Mixtacki, Julia; Stoye, JensUniBi
Einrichtung
Centrum für Biotechnologie > Institut für Bioinformatik
Centrum für Biotechnologie > Arbeitsgruppe J. Stoye
Technische Fakultät > AG Genominformatik
Stichworte
Genomic distance; Sorting by translocations; Comparative genomics; Genome rearrangements; fissions and inversions; fusions; computation
Erscheinungsjahr
2009
Zeitschriftentitel
Theoretical Computer Science
Band
410
Ausgabe
51
Seite(n)
5300-5316
ISSN
0304-3975
Page URI
https://pub.uni-bielefeld.de/record/1589663

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. https://doi.org/10.1016/j.tcs.2009.09.008
Bergeron, Anne, Mixtacki, Julia, and Stoye, Jens. 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.
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
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.
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.
Export

Markieren/ Markierung löschen
Markierte Publikationen

Open Data PUB

Web of Science

Dieser Datensatz im Web of Science®
Suchen in

Google Scholar