An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/bibm/SunJ21
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/bibm/SunJ21
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Chengcheng_Sun
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Haitao_Jiang
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FBIBM52615.2021.9669334
>
foaf:
homepage
<
https://doi.org/10.1109/BIBM52615.2021.9669334
>
dc:
identifier
DBLP conf/bibm/SunJ21
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FBIBM52615.2021.9669334
(xsd:string)
dcterms:
issued
2021
(xsd:gYear)
rdfs:
label
An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Chengcheng_Sun
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Haitao_Jiang
>
swrc:
pages
86-91
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/bibm/2021
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/bibm/SunJ21/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/bibm/SunJ21
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/bibm/bibm2021.html#SunJ21
>
rdfs:
seeAlso
<
https://doi.org/10.1109/BIBM52615.2021.9669334
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/bibm
>
dc:
title
An approximation algorithm for unifying adjacencies by double cut and joins in unsigned genomes.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document