A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance.
A. Bergeron, J. Mixtacki, and J. Stoye. Structure Discovery in Biology: Motifs, Networks & Phylogenies, volume 10231 of Dagstuhl Seminar Proceedings, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany, (2010)
Please log in to take part in the discussion (add own reviews or comments).
Cite this publication
More citation styles
- please select -
%0 Conference Paper
%1 conf/dagstuhl/BergeronMS10
%A Bergeron, Anne
%A Mixtacki, Julia
%A Stoye, Jens
%B Structure Discovery in Biology: Motifs, Networks & Phylogenies
%D 2010
%E Apostolico, Alberto
%E Dress, Andreas W. M.
%E Parida, Laxmi
%I Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany
%K dblp
%T A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance.
%U http://dblp.uni-trier.de/db/conf/dagstuhl/P10231.html#BergeronMS10
%V 10231
@inproceedings{conf/dagstuhl/BergeronMS10,
added-at = {2018-08-23T00:00:00.000+0200},
author = {Bergeron, Anne and Mixtacki, Julia and Stoye, Jens},
biburl = {https://www.bibsonomy.org/bibtex/2217864552dd20ade179e1efd0f305772/dblp},
booktitle = {Structure Discovery in Biology: Motifs, Networks & Phylogenies},
crossref = {conf/dagstuhl/2010P10231},
editor = {Apostolico, Alberto and Dress, Andreas W. M. and Parida, Laxmi},
ee = {http://drops.dagstuhl.de/opus/volltexte/2010/2689/},
interhash = {6dddee9ba55f66afe3e9f02cc3fb2e5d},
intrahash = {217864552dd20ade179e1efd0f305772},
keywords = {dblp},
publisher = {Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany},
series = {Dagstuhl Seminar Proceedings},
timestamp = {2024-04-09T10:25:30.000+0200},
title = {A New Linear Time Algorithm to Compute the Genomic Distance Via the Double Cut and Join Distance.},
url = {http://dblp.uni-trier.de/db/conf/dagstuhl/P10231.html#BergeronMS10},
volume = 10231,
year = 2010
}