Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
Resource URI: https://dblp.l3s.de/d2r/resource/publications/conf/spire/MatsumotoKTSA00
Home
|
Example Publications
Property
Value
dcterms:
bibliographicCitation
<
http://dblp.uni-trier.de/rec/bibtex/conf/spire/MatsumotoKTSA00
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Ayumi_Shinohara
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Masayuki_Takeda
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Setsuo_Arikawa
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Takuya_Kida
>
dc:
creator
<
https://dblp.l3s.de/d2r/resource/authors/Tetsuya_Matsumoto
>
foaf:
homepage
<
http://dx.doi.org/doi.org%2F10.1109%2FSPIRE.2000.878198
>
foaf:
homepage
<
https://doi.org/10.1109/SPIRE.2000.878198
>
dc:
identifier
DBLP conf/spire/MatsumotoKTSA00
(xsd:string)
dc:
identifier
DOI doi.org%2F10.1109%2FSPIRE.2000.878198
(xsd:string)
dcterms:
issued
2000
(xsd:gYear)
rdfs:
label
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
(xsd:string)
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Ayumi_Shinohara
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Masayuki_Takeda
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Setsuo_Arikawa
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Takuya_Kida
>
foaf:
maker
<
https://dblp.l3s.de/d2r/resource/authors/Tetsuya_Matsumoto
>
swrc:
pages
221-228
(xsd:string)
dcterms:
partOf
<
https://dblp.l3s.de/d2r/resource/publications/conf/spire/2000
>
owl:
sameAs
<
http://bibsonomy.org/uri/bibtexkey/conf/spire/MatsumotoKTSA00/dblp
>
owl:
sameAs
<
http://dblp.rkbexplorer.com/id/conf/spire/MatsumotoKTSA00
>
rdfs:
seeAlso
<
http://dblp.uni-trier.de/db/conf/spire/spire2000.html#MatsumotoKTSA00
>
rdfs:
seeAlso
<
https://doi.org/10.1109/SPIRE.2000.878198
>
swrc:
series
<
https://dblp.l3s.de/d2r/resource/conferences/spire
>
dc:
subject
data compression; bit-parallelism; approximate string matching; compressed texts; collage system; dictionary-based compression methods; machine word; pattern length; allowed errors; time complexity; space complexity; dictionary size; token sequence; Ziv-Lempel compression methods; compressed length
(xsd:string)
dc:
title
Bit-Parallel Approach to Approximate String Matching in Compressed Texts.
(xsd:string)
dc:
type
<
http://purl.org/dc/dcmitype/Text
>
rdf:
type
swrc:InProceedings
rdf:
type
foaf:Document