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

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

Namespace Prefixes

PrefixIRI
n9http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://localhost/temp/predkladatel/
n6http://purl.org/net/nknouf/ns/bibtex#
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n7http://linked.opendata.cz/resource/domain/vavai/projekt/
n4http://linked.opendata.cz/ontology/domain/vavai/
n22https://schema.org/
n8http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n3http://linked.opendata.cz/ontology/domain/vavai/riv/
n2http://linked.opendata.cz/resource/domain/vavai/vysledek/
rdfhttp://www.w3.org/1999/02/22-rdf-syntax-ns#
n11http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F03%3A03088066%21RIV07-GA0-21230___/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n20http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n17http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F03%3A03088066%21RIV07-GA0-21230___
rdf:type
n4:Vysledek skos:Concept
dcterms:description
There are several data structures that allow searching for a pattern P in a preprocessed text T in time dependent just on the length of P. In this paper we present an implementation of CDAWG's---Compact Direct Acyclic Word Graphs. While the previous implementations of CDAWG's required from 7n to 23n bytes of memory space, ours achieves 1.7n to 5n for a text T of length n. The implementation is suitable for large data files, since it minimizes the number of disk accesses. If disk accesses are not to be optimized, space requirements can be further decreased. There are several data structures that allow searching for a pattern P in a preprocessed text T in time dependent just on the length of P. In this paper we present an implementation of CDAWG's---Compact Direct Acyclic Word Graphs. While the previous implementations of CDAWG's required from 7n to 23n bytes of memory space, ours achieves 1.7n to 5n for a text T of length n. The implementation is suitable for large data files, since it minimizes the number of disk accesses. If disk accesses are not to be optimized, space requirements can be further decreased. Není k dispozici
dcterms:title
Není k dispozici On the Implementation of Compact DAWG's On the Implementation of Compact DAWG's
skos:prefLabel
Není k dispozici On the Implementation of Compact DAWG's On the Implementation of Compact DAWG's
skos:notation
RIV/68407700:21230/03:03088066!RIV07-GA0-21230___
n3:strany
289 ; 294
n3:aktivita
n16:Z n16:P
n3:aktivity
P(GA201/01/1433), P(GP201/01/P082), Z(MSM 212300014)
n3:dodaniDat
n17:2007
n3:domaciTvurceVysledku
n15:9170367
n3:druhVysledku
n20:D
n3:duvernostUdaju
n13:S
n3:entitaPredkladatele
n11:predkladatel
n3:idSjednocenehoVysledku
619463
n3:idVysledku
RIV/68407700:21230/03:03088066
n3:jazykVysledku
n19:eng
n3:klicovaSlova
DAWG; factor automaton; finite automata; implementation; pattern matching
n3:klicoveSlovo
n10:implementation n10:DAWG n10:pattern%20matching n10:factor%20automaton n10:finite%20automata
n3:kontrolniKodProRIV
[D7C62D29FC04]
n3:mistoKonaniAkce
Tours
n3:mistoVydani
Berlin
n3:nazevZdroje
Implementation and Application of Automata
n3:obor
n18:JC
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
2
n3:projekt
n7:GA201%2F01%2F1433 n7:GP201%2F01%2FP082
n3:rokUplatneniVysledku
n17:2003
n3:tvurceVysledku
Holub, Jan Crochemore, M.
n3:typAkce
n9:WRD
n3:zahajeniAkce
2002-05-03+02:00
n3:zamer
n8:MSM%20212300014
s:numberOfPages
6
n6:hasPublisher
Springer-Verlag
n22:isbn
3-540-40391-4
n21:organizacniJednotka
21230