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

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

Namespace Prefixes

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

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F07%3A03133334%21RIV08-GA0-21230___
rdf:type
n22:Vysledek skos:Concept
dcterms:description
We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matching all subpatterns. The bit-parallel approach enables us to count the length of the longest subpatterns. We present an algorithm for matching significant subpatterns of a given pattern in a text. The significant subpattern is any subpattern of the pattern which is at least of some specified length. We use bit-parallel simulation of an automaton for matching all subpatterns. The bit-parallel approach enables us to count the length of the longest subpatterns. Není k dispozici
dcterms:title
Significant Subpatterns Matching Vyhledávání významných podvzorků v textu Significant Subpatterns Matching
skos:prefLabel
Significant Subpatterns Matching Significant Subpatterns Matching Vyhledávání významných podvzorků v textu
skos:notation
RIV/68407700:21230/07:03133334!RIV08-GA0-21230___
n4:strany
317;319
n4:aktivita
n18:Z n18:P
n4:aktivity
P(GA201/06/1039), Z(MSM6840770014)
n4:dodaniDat
n8:2008
n4:domaciTvurceVysledku
n21:6420443
n4:druhVysledku
n5:D
n4:duvernostUdaju
n14:S
n4:entitaPredkladatele
n20:predkladatel
n4:idSjednocenehoVysledku
449771
n4:idVysledku
RIV/68407700:21230/07:03133334
n4:jazykVysledku
n10:eng
n4:klicovaSlova
NFA simulation; finite automata; pattern matching; subpattern
n4:klicoveSlovo
n12:pattern%20matching n12:finite%20automata n12:subpattern n12:NFA%20simulation
n4:kontrolniKodProRIV
[E579F4CAB5F2]
n4:mistoKonaniAkce
Prague
n4:mistoVydani
Berlin
n4:nazevZdroje
Twelfth International Conference on Implementation and Application of Automata
n4:obor
n13:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:projekt
n16:GA201%2F06%2F1039
n4:rokUplatneniVysledku
n8:2007
n4:tvurceVysledku
Šupol, Jan
n4:typAkce
n19:EUR
n4:zahajeniAkce
2007-07-16+02:00
n4:zamer
n15:MSM6840770014
s:numberOfPages
3
n7:hasPublisher
Springer-Verlag
n3:isbn
978-3-540-76335-2
n11:organizacniJednotka
21230