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

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

Namespace Prefixes

PrefixIRI
n5http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n21http://purl.org/net/nknouf/ns/bibtex#
n17http://localhost/temp/predkladatel/
n20http://linked.opendata.cz/resource/domain/vavai/projekt/
n7http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n16http://linked.opendata.cz/ontology/domain/vavai/
n4http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21230%2F03%3A03088936%21RIV%2F2004%2FGA0%2F212304%2FN/
n19https://schema.org/
n9http://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#
n13http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n18http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n15http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n6http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n22http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21230%2F03%3A03088936%21RIV%2F2004%2FGA0%2F212304%2FN
rdf:type
n16:Vysledek skos:Concept
dcterms:description
A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings. A new algorithm that creates a common subsequence automaton for a set of strings is presented. Moreover, it is shown that a longest common subsequence of two strings over a constant alphabet can be found in O(|A|(|S1|+|S2|+r)) time, where |A| is the size of the alphabet, |Si| is the length of the input string i, and r is the number of matching pairs (such pair i,j that S1(i)=S2(j)). This algorithm can be simple generalized for multiple strings.
dcterms:title
The Longest Common Subsequence Problem a Finite Automata Approach The Longest Common Subsequence Problem a Finite Automata Approach
skos:prefLabel
The Longest Common Subsequence Problem a Finite Automata Approach The Longest Common Subsequence Problem a Finite Automata Approach
skos:notation
RIV/68407700:21230/03:03088936!RIV/2004/GA0/212304/N
n3:strany
326 ; 327
n3:aktivita
n15:P n15:Z
n3:aktivity
P(GA201/01/1433), Z(MSM 212300014)
n3:dodaniDat
n22:2004
n3:domaciTvurceVysledku
n7:3764818 n7:7921381
n3:druhVysledku
n6:D
n3:duvernostUdaju
n18:S
n3:entitaPredkladatele
n4:predkladatel
n3:idSjednocenehoVysledku
613849
n3:idVysledku
RIV/68407700:21230/03:03088936
n3:jazykVysledku
n10:eng
n3:klicovaSlova
finite automata, common subsequence automata, longest common subsequence
n3:klicoveSlovo
n13:common%20subsequence%20automata n13:finite%20automata n13:longest%20common%20subsequence
n3:kontrolniKodProRIV
[B2F0BAFF02A0]
n3:mistoKonaniAkce
Praha
n3:mistoVydani
Praha
n3:nazevZdroje
Proceedings of Workshop 2003
n3:obor
n14:JD
n3:pocetDomacichTvurcuVysledku
2
n3:pocetTvurcuVysledku
2
n3:projekt
n20:GA201%2F01%2F1433
n3:rokUplatneniVysledku
n22:2003
n3:tvurceVysledku
Polcar, Tomáš Melichar, Bořivoj
n3:typAkce
n5:EUR
n3:zahajeniAkce
2003-02-10+01:00
n3:zamer
n9:MSM%20212300014
s:numberOfPages
2
n21:hasPublisher
České vysoké učení technické v Praze
n19:isbn
80-01-02708-2
n17:organizacniJednotka
21230