Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/soda/BrodalFMPS13
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/soda/BrodalFMPS13
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Sand
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Christian_N._S._Pedersen
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Gerth_St%E2%88%9A%C5%82lting_Brodal
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Rolf_Fagerberg
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Thomas_Mailund
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1137%2F1.9781611973105.130
>
foaf:
homepage
<
https://doi.org/10.1137/1.9781611973105.130
>
dc:
identifier
DBLP conf/soda/BrodalFMPS13
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1137%2F1.9781611973105.130
(xsd:string)
dcterms:
issued
2013
(xsd:gYear)
rdfs:
label
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Andreas_Sand
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Christian_N._S._Pedersen
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Gerth_St%E2%88%9A%C5%82lting_Brodal
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Rolf_Fagerberg
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Thomas_Mailund
>
swrc:
pages
1814-1832
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/soda/2013
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/soda/BrodalFMPS13/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/soda/BrodalFMPS13
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/soda/soda2013.html#BrodalFMPS13
>
rdfs:
seeAlso
<
https://doi.org/10.1137/1.9781611973105.130
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/soda
>
dc:
title
Efficient algorithms for computing the triplet and quartet distance between trees of arbitrary degree.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document