Parallel Algorithms for the Longest Common Subsequence Problem.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/journals/tpds/LuL94
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/journals/tpds/LuL94
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Hua_Lin
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Mi_Lu
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2F71.298210
>
foaf:
homepage
<
https://doi.org/10.1109/71.298210
>
dc:
identifier
DBLP journals/tpds/LuL94
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2F71.298210
(xsd:string)
dcterms:
issued
1994
(xsd:gYear)
swrc:
journal
<
https://dblp.l3s.de/d2r/resource/journals/tpds
>
rdfs:
label
Parallel Algorithms for the Longest Common Subsequence Problem.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Hua_Lin
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Mi_Lu
>
swrc:
number
8
(xsd:string)
swrc:
pages
835-848
(xsd:string)
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/journals/tpds/LuL94/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/journals/tpds/LuL94
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/journals/tpds/tpds5.html#LuL94
>
rdfs:
seeAlso
<
https://doi.org/10.1109/71.298210
>
dc:
subject
parallel algorithms; computational complexity; directed graphs; parallel algorithms; longest common subsequence problem; string subsequences; symbol deletion; complexity bound; decision tree model; CREW-PRAM model; concurrent-read exclusive-write parallel random-access machine; grid directed graph; maximum-cost path; totally monotone array
(xsd:string)
dc:
title
Parallel Algorithms for the Longest Common Subsequence Problem.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:Article
rdf:
type
foaf:Document
swrc:
volume
5
(xsd:string)