Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/cpm/Asahiro0LMOU22
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/cpm/Asahiro0LMOU22
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Eiji_Miyano
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Guohui_Lin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hirotaka_Ono_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Jesper_Jansson_0001
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tadatoshi_Utashima
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Yuichi_Asahiro
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.4230%2FLIPIcs.CPM.2022.15
>
foaf:
homepage
<
https://doi.org/10.4230/LIPIcs.CPM.2022.15
>
dc:
identifier
DBLP conf/cpm/Asahiro0LMOU22
(xsd:string)
dc:
identifier
DOI doi.org%2F10.4230%2FLIPIcs.CPM.2022.15
(xsd:string)
dcterms:
issued
2022
(xsd:gYear)
rdfs:
label
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Eiji_Miyano
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Guohui_Lin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hirotaka_Ono_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Jesper_Jansson_0001
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tadatoshi_Utashima
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Yuichi_Asahiro
>
swrc:
pages
15:1-15:17
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/cpm/2022
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/cpm/Asahiro0LMOU22/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/cpm/Asahiro0LMOU22
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/cpm/cpm2022.html#Asahiro0LMOU22
>
rdfs:
seeAlso
<
https://doi.org/10.4230/LIPIcs.CPM.2022.15
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/cpm
>
dc:
title
Polynomial-Time Equivalences and Refined Algorithms for Longest Common Subsequence Variants.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document