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

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

Namespace Prefixes

PrefixIRI
n12http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n19http://purl.org/net/nknouf/ns/bibtex#
n17http://localhost/temp/predkladatel/
n15http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n18http://linked.opendata.cz/ontology/domain/vavai/
n20http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F04%3A03100452%21RIV%2F2005%2FMSM%2F212305%2FN/
n21http://linked.opendata.cz/resource/domain/vavai/zamer/
n16https://schema.org/
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#
n6http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n4http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n9http://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%2F04%3A03100452%21RIV%2F2005%2FMSM%2F212305%2FN
rdf:type
skos:Concept n18:Vysledek
dcterms:description
A new algorithm for pattern matching in text coded by a finite translation automaton is given. Proposed algorithm is based on finite automata and it is able to solve many pattern matching problems. The proposed algorithm runs in linear time in respect to the length of the given compressed text. A new algorithm for pattern matching in text coded by a finite translation automaton is given. Proposed algorithm is based on finite automata and it is able to solve many pattern matching problems. The proposed algorithm runs in linear time in respect to the length of the given compressed text. Není k dispozici
dcterms:title
Pattern Matching in Text Coded by Finite Translation Automaton Není k dispozici Pattern Matching in Text Coded by Finite Translation Automaton
skos:prefLabel
Pattern Matching in Text Coded by Finite Translation Automaton Není k dispozici Pattern Matching in Text Coded by Finite Translation Automaton
skos:notation
RIV/68407700:21230/04:03100452!RIV/2005/MSM/212305/N
n3:strany
212 ; 214
n3:aktivita
n13:Z
n3:aktivity
Z(MSM 212300014)
n3:dodaniDat
n8:2005
n3:domaciTvurceVysledku
n15:5868785 n15:3764818
n3:druhVysledku
n5:D
n3:duvernostUdaju
n14:S
n3:entitaPredkladatele
n20:predkladatel
n3:idSjednocenehoVysledku
578977
n3:idVysledku
RIV/68407700:21230/04:03100452
n3:jazykVysledku
n4:eng
n3:klicovaSlova
finite automata; pattern matching; pattern matching in compressed text; text compression; transducers; translation finite automata
n3:klicoveSlovo
n6:translation%20finite%20automata n6:transducers n6:pattern%20matching%20in%20compressed%20text n6:pattern%20matching n6:text%20compression n6:finite%20automata
n3:kontrolniKodProRIV
[92797A96B299]
n3:mistoKonaniAkce
Ljubljana
n3:mistoVydani
Ljubljana
n3:nazevZdroje
Proceedings of the 7th International Multiconference Information Society IS'2004
n3:obor
n9:IN
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:rokUplatneniVysledku
n8:2004
n3:tvurceVysledku
Lahoda, Jan Melichar, Bořivoj
n3:typAkce
n12:WRD
n3:zahajeniAkce
2004-10-09+02:00
n3:zamer
n21:MSM%20212300014
s:numberOfPages
3
n19:hasPublisher
Institut Jozef Stefan
n16:isbn
961-6303-65-1
n17:organizacniJednotka
21230