This HTML5 document contains 41 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/
n12http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n8http://linked.opendata.cz/ontology/domain/vavai/
n10http://linked.opendata.cz/resource/domain/vavai/zamer/
shttp://schema.org/
skoshttp://www.w3.org/2004/02/skos/core#
n4http://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#
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F04%3A03100391%21RIV%2F2005%2FMSM%2F212305%2FN/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n11http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n6http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F04%3A03100391%21RIV%2F2005%2FMSM%2F212305%2FN
rdf:type
n8:Vysledek skos:Concept
dcterms:description
Není k dispozici Given two strings, pattern P and text T, episode substring of P in T is a minimal substring of T that contains P as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very quickly. With the structure, we can find for example all episode substrings or the shortest episode substring in O(mw) time where m is the length of the pattern and w is the number of episode substrings found. Given two strings, pattern P and text T, episode substring of P in T is a minimal substring of T that contains P as a subsequence. The episode matching problem is to find all episode substrings. We present a new data structure called Episode Directed Acyclic Subsequence Graph that can be used to solve the problem very quickly. With the structure, we can find for example all episode substrings or the shortest episode substring in O(mw) time where m is the length of the pattern and w is the number of episode substrings found.
dcterms:title
Není k dispozici Episode Directed Acyclic Subsequence Graph Episode Directed Acyclic Subsequence Graph
skos:prefLabel
Episode Directed Acyclic Subsequence Graph Není k dispozici Episode Directed Acyclic Subsequence Graph
skos:notation
RIV/68407700:21230/04:03100391!RIV/2005/MSM/212305/N
n4:strany
35 ; 40
n4:aktivita
n9:Z
n4:aktivity
Z(MSM 212300014)
n4:cisloPeriodika
1
n4:dodaniDat
n6:2005
n4:domaciTvurceVysledku
n17:8104867
n4:druhVysledku
n13:J
n4:duvernostUdaju
n11:S
n4:entitaPredkladatele
n5:predkladatel
n4:idSjednocenehoVysledku
563053
n4:idVysledku
RIV/68407700:21230/04:03100391
n4:jazykVysledku
n18:eng
n4:klicovaSlova
episode matching; finite automata; subsequences
n4:klicoveSlovo
n14:subsequences n14:episode%20matching n14:finite%20automata
n4:kodStatuVydavatele
FI - Finská republika
n4:kontrolniKodProRIV
[C0983C154097]
n4:nazevZdroje
Nordic Journal of Computing
n4:obor
n15:IN
n4:pocetDomacichTvurcuVysledku
1
n4:pocetTvurcuVysledku
1
n4:rokUplatneniVysledku
n6:2004
n4:svazekPeriodika
11
n4:tvurceVysledku
Troníček, Zdeněk
n4:zamer
n10:MSM%20212300014
s:issn
1236-6064
s:numberOfPages
6
n12:organizacniJednotka
21230