[RDF data]
Home | Example Publications
PropertyValue
dcterms:bibliographicCitation <http://dblp.uni-trier.de/rec/bibtex/conf/cpm/JiangLMZ00>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Bin_Ma_0002>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Guohui_Lin>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Kaizhong_Zhang>
dc:creator <https://dblp.l3s.de/d2r/resource/authors/Tao_Jiang_0001>
foaf:homepage <http://dx.doi.org/doi.org%2F10.1007%2F3-540-45123-4%5F15>
foaf:homepage <https://doi.org/10.1007/3-540-45123-4_15>
dc:identifier DBLP conf/cpm/JiangLMZ00 (xsd:string)
dc:identifier DOI doi.org%2F10.1007%2F3-540-45123-4%5F15 (xsd:string)
dcterms:issued 2000 (xsd:gYear)
rdfs:label The Longest Common Subsequence Problem for Arc-Annotated Sequences. (xsd:string)
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Bin_Ma_0002>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Guohui_Lin>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Kaizhong_Zhang>
foaf:maker <https://dblp.l3s.de/d2r/resource/authors/Tao_Jiang_0001>
swrc:pages 154-165 (xsd:string)
dcterms:partOf <https://dblp.l3s.de/d2r/resource/publications/conf/cpm/2000>
owl:sameAs <http://bibsonomy.org/uri/bibtexkey/conf/cpm/JiangLMZ00/dblp>
owl:sameAs <http://dblp.rkbexplorer.com/id/conf/cpm/JiangLMZ00>
rdfs:seeAlso <http://dblp.uni-trier.de/db/conf/cpm/cpm2000.html#JiangLMZ00>
rdfs:seeAlso <https://doi.org/10.1007/3-540-45123-4_15>
swrc:series <https://dblp.l3s.de/d2r/resource/conferences/cpm>
dc:subject Sequence annotation, longest common subsequence, approximation algorithm, maximum independent set, MAX SNP-hard, dynamic programming. (xsd:string)
dc:title The Longest Common Subsequence Problem for Arc-Annotated Sequences. (xsd:string)
dc:type <http://purl.org/dc/dcmitype/Text>
rdf:type swrc:InProceedings
rdf:type foaf:Document