This HTML5 document contains 52 embedded RDF statements represented using HTML+Microdata notation.

The embedded RDF content will be recognized by any processor of HTML5 Microdata.

Namespace Prefixes

PrefixIRI
dctermshttp://purl.org/dc/terms/
yago-reshttp://yago-knowledge.org/resource/
n6http://cc.ee.ntu.edu.tw/~yen/papers/
n11https://web.archive.org/web/20030313175423/http:/cc.ee.ntu.edu.tw/~yen/papers/
dbohttp://dbpedia.org/ontology/
foafhttp://xmlns.com/foaf/0.1/
n9http://www.i.kyushu-u.ac.jp/~takeda/papers/
n15https://global.dbpedia.org/id/
yagohttp://dbpedia.org/class/yago/
dbthttp://dbpedia.org/resource/Template:
rdfshttp://www.w3.org/2000/01/rdf-schema#
freebasehttp://rdf.freebase.com/ns/
n19http://vlsi.cs.ucf.edu/nsf/files/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
owlhttp://www.w3.org/2002/07/owl#
n24https://scholar.archive.org/work/42bnluwv6jfb7p4wra3diihz7m/access/wayback/http:/www.dmi.unict.it/~faro/algocom/prova02/
n23https://web.archive.org/web/20070808170750/http:/www.i.kyushu-u.ac.jp/~takeda/papers/
wikipedia-enhttp://en.wikipedia.org/wiki/
dbphttp://dbpedia.org/property/
dbchttp://dbpedia.org/resource/Category:
provhttp://www.w3.org/ns/prov#
xsdhhttp://www.w3.org/2001/XMLSchema#
goldhttp://purl.org/linguistics/gold/
n8http://www.cs.helsinki.fi/njc/References/karpinskirs1997:
wikidatahttp://www.wikidata.org/entity/
dbrhttp://dbpedia.org/resource/

Statements

Subject Item
dbr:Compressed_search
dbo:wikiPageWikiLink
dbr:Compressed_pattern_matching
dbo:wikiPageRedirects
dbr:Compressed_pattern_matching
Subject Item
dbr:Compressed_pattern_matching
rdf:type
dbo:Election yago:Cognition100023271 yago:PsychologicalFeature100023100 yago:Information105816287 yago:WikicatComputerData yago:Abstraction100002137 yago:Datum105816622
rdfs:label
Compressed pattern matching
rdfs:comment
In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
dcterms:subject
dbc:Pattern_matching dbc:Computer_data dbc:Data_compression
dbo:wikiPageID
22095269
dbo:wikiPageRevisionID
1099996343
dbo:wikiPageWikiLink
dbr:Variable_width_encoding dbr:Data_compression dbr:String_searching_algorithm dbc:Pattern_matching dbc:Computer_data dbr:Mask_(computing) dbr:Code_word dbr:Computer_science dbc:Data_compression
dbo:wikiPageExternalLink
n6:compsac2002.pdf n8:172.html n9:IPSJ40.pdf n11:compsac2002.pdf n19:lzw_cpm.pdf n23:IPSJ40.pdf n24:paper24.pdf
owl:sameAs
n15:4hgrX wikidata:Q5157027 freebase:m.05p6w57 yago-res:Compressed_pattern_matching
dbp:wikiPageUsesTemplate
dbt:Strings dbt:Citation dbt:Reflist dbt:Short_description dbt:Cite_journal
dbo:abstract
In computer science, compressed pattern matching (abbreviated as CPM) is the process of searching for patterns in compressed data with little or no decompression. Searching in a compressed string is faster than searching an uncompressed string and requires less space.
gold:hypernym
dbr:Process
prov:wasDerivedFrom
wikipedia-en:Compressed_pattern_matching?oldid=1099996343&ns=0
dbo:wikiPageLength
4205
foaf:isPrimaryTopicOf
wikipedia-en:Compressed_pattern_matching
Subject Item
dbr:CPM
dbo:wikiPageWikiLink
dbr:Compressed_pattern_matching
dbo:wikiPageDisambiguates
dbr:Compressed_pattern_matching
Subject Item
dbr:Compressed_Pattern_Matching
dbo:wikiPageWikiLink
dbr:Compressed_pattern_matching
dbo:wikiPageRedirects
dbr:Compressed_pattern_matching
Subject Item
dbr:String-searching_algorithm
dbo:wikiPageWikiLink
dbr:Compressed_pattern_matching
Subject Item
wikipedia-en:Compressed_pattern_matching
foaf:primaryTopic
dbr:Compressed_pattern_matching