[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/journals/almob/BorkCWSL17>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Daniel_Bork>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jean_Sung>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Jincheng_Wang>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ran_Libeskind-Hadas>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Ricson_Cheng>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1186%2Fs13015-017-0098-8>
foaf:homepage <https://doi.org/10.1186/s13015-017-0098-8>
dc:identifier DBLP journals/almob/BorkCWSL17 (xsd:string)
dc:identifier DOI doi.org%2F10.1186%2Fs13015-017-0098-8 (xsd:string)
dcterms:issued 2017 (xsd:gYear)
swrc:journal <https://dblp.l3s.de/d2r/resource/journals/almob>
rdfs:label On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Daniel_Bork>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jean_Sung>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Jincheng_Wang>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ran_Libeskind-Hadas>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Ricson_Cheng>
swrc:number 1 (xsd:string)
swrc:pages 6:1-6:12 (xsd:string)
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/journals/almob/BorkCWSL17/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/journals/almob/BorkCWSL17>
rdfs:seeAlso <http://dblp.uni-trier.de/db/journals/almob/almob12.html#BorkCWSL17>
rdfs:seeAlso <https://doi.org/10.1186/s13015-017-0098-8>
dc:title On the computational complexity of the maximum parsimony reconciliation problem in the duplication-loss-coalescence model. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:Article
rdf:type foaf:Document
swrc:volume 12 (xsd:string)