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/bibm/SunJ21
%A Sun, Chengcheng
%A Jiang, Haitao
%B BIBM
%D 2021
%E Huang, Yufei
%E Kurgan, Lukasz A.
%E Luo, Feng
%E Hu, Xiaohua
%E Chen, Yidong
%E Dougherty, Edward R.
%E Kloczkowski, Andrzej
%E Li, Yaohang
%I IEEE
%K dblp
%P 86-91
%T An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
%U http://dblp.uni-trier.de/db/conf/bibm/bibm2021.html#SunJ21
%@ 978-1-6654-0126-5
@inproceedings{conf/bibm/SunJ21,
added-at = {2022-01-18T00:00:00.000+0100},
author = {Sun, Chengcheng and Jiang, Haitao},
biburl = {https://www.bibsonomy.org/bibtex/2568eb6b639e4ddfe3c4c80c1d59df6b3/dblp},
booktitle = {BIBM},
crossref = {conf/bibm/2021},
editor = {Huang, Yufei and Kurgan, Lukasz A. and Luo, Feng and Hu, Xiaohua and Chen, Yidong and Dougherty, Edward R. and Kloczkowski, Andrzej and Li, Yaohang},
ee = {https://doi.org/10.1109/BIBM52615.2021.9669334},
interhash = {f13cd9cb53771bbe6a2c15b7db590835},
intrahash = {568eb6b639e4ddfe3c4c80c1d59df6b3},
isbn = {978-1-6654-0126-5},
keywords = {dblp},
pages = {86-91},
publisher = {IEEE},
timestamp = {2024-08-26T07:25:58.000+0200},
title = {An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.},
url = {http://dblp.uni-trier.de/db/conf/bibm/bibm2021.html#SunJ21},
year = 2021
}