Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. | D2R Server publishing the DBLP Bibliography Database, hosted at L3S Research Center

Property	Value
dcterms:bibliographicCitation	<http://dblp.uni-trier.de/rec/bibtex/conf/parco/Tiskin05>
dc:creator	<https://dblp.l3s.de/d2r/resource/authors/Alexandre_Tiskin>
dc:identifier	DBLP conf/parco/Tiskin05 (xsd:string)
dcterms:issued	2005 (xsd:gYear)
rdfs:label	Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. (xsd:string)
foaf:maker	<https://dblp.l3s.de/d2r/resource/authors/Alexandre_Tiskin>
swrc:pages	827-834 (xsd:string)
dcterms:partOf	<https://dblp.l3s.de/d2r/resource/publications/conf/parco/2005>
owl:sameAs	<http://bibsonomy.org/uri/bibtexkey/conf/parco/Tiskin05/dblp>
owl:sameAs	<http://dblp.rkbexplorer.com/id/conf/parco/Tiskin05>
rdfs:seeAlso	<http://dblp.uni-trier.de/db/conf/parco/parco2005.html#Tiskin05>
swrc:series	<https://dblp.l3s.de/d2r/resource/conferences/parco>
dc:title	Efficient Representation and Parallel Computation of String-Substring Longest Common Subsequences. (xsd:string)
dc:type	<http://purl.org/dc/dcmitype/Text>
rdf:type	swrc:InProceedings
rdf:type	foaf:Document