| http://dbpedia.org/ontology/abstract
|
A factor oracle is a finite state automato … A factor oracle is a finite state automaton that can efficiently search for factors (substrings) in a body of text. Older techniques, such as suffix trees, were time-efficient but required significant amounts of memory. Factor oracles, by contrast, can be constructed in linear time and space in an incremental fashion. time and space in an incremental fashion.
|
| http://dbpedia.org/ontology/wikiPageExternalLink
|
https://web.archive.org/web/20111129201351/http:/cosmal.ucsd.edu/cal/projects/CATbox/catboxdownload.htm +
|
| http://dbpedia.org/ontology/wikiPageID
|
33736410
|
| http://dbpedia.org/ontology/wikiPageLength
|
1712
|
| http://dbpedia.org/ontology/wikiPageRevisionID
|
910966476
|
| http://dbpedia.org/ontology/wikiPageWikiLink
|
http://dbpedia.org/resource/Generalised_suffix_tree +
, http://dbpedia.org/resource/Deterministic_acyclic_finite_state_automaton +
, http://dbpedia.org/resource/Finite_state_automaton +
, http://dbpedia.org/resource/Substring +
, http://dbpedia.org/resource/Category:Automata_%28computation%29 +
, http://dbpedia.org/resource/Category:Substring_indices +
, http://dbpedia.org/resource/Suffix_automaton +
, http://dbpedia.org/resource/Suffix_array +
, http://dbpedia.org/resource/Suffix_tree +
|
| http://purl.org/dc/terms/subject
|
http://dbpedia.org/resource/Category:Automata_%28computation%29 +
, http://dbpedia.org/resource/Category:Substring_indices +
|
| http://purl.org/linguistics/gold/hypernym
|
http://dbpedia.org/resource/Automaton +
|
| http://www.w3.org/ns/prov#wasDerivedFrom
|
http://en.wikipedia.org/wiki/Factor_oracle?oldid=910966476&ns=0 +
|
| http://xmlns.com/foaf/0.1/isPrimaryTopicOf
|
http://en.wikipedia.org/wiki/Factor_oracle +
|
| owl:sameAs |
https://global.dbpedia.org/id/4jprv +
, http://dbpedia.org/resource/Factor_oracle +
, http://yago-knowledge.org/resource/Factor_oracle +
, http://rdf.freebase.com/ns/m.0hhqnys +
, http://www.wikidata.org/entity/Q5428727 +
|
| rdf:type |
http://dbpedia.org/class/yago/Scale113850304 +
, http://dbpedia.org/class/yago/WikicatSubstringIndices +
, http://dbpedia.org/class/yago/Abstraction100002137 +
, http://dbpedia.org/class/yago/Index113851067 +
, http://dbpedia.org/class/yago/SystemOfMeasurement113577171 +
, http://dbpedia.org/class/yago/Measure100033615 +
, http://dbpedia.org/class/yago/Standard107260623 +
|
| rdfs:comment |
A factor oracle is a finite state automato … A factor oracle is a finite state automaton that can efficiently search for factors (substrings) in a body of text. Older techniques, such as suffix trees, were time-efficient but required significant amounts of memory. Factor oracles, by contrast, can be constructed in linear time and space in an incremental fashion. time and space in an incremental fashion.
|
| rdfs:label |
Factor oracle
|
