[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/fct/EvansS03>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Andrew_D._Smith>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Patricia_A._Evans>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F978-3-540-45077-1%5F20>
foaf:homepage <https://doi.org/10.1007/978-3-540-45077-1_20>
dc:identifier DBLP conf/fct/EvansS03 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F978-3-540-45077-1%5F20 (xsd:string)
dcterms:issued 2003 (xsd:gYear)
rdfs:label Complexity of Approximating Closest Substring Problems. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Andrew_D._Smith>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Patricia_A._Evans>
swrc:pages 210-221 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/fct/2003>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/fct/EvansS03/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/fct/EvansS03>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/fct/fct2003.html#EvansS03>
rdfs:seeAlso <https://doi.org/10.1007/978-3-540-45077-1_20>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/fct>
dc:subject Approximation algorithms; Hardness of approximation; Closest Substring (xsd:string)
dc:title Complexity of Approximating Closest Substring Problems. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document