This HTML5 document contains 40 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/
n19http://purl.org/net/nknouf/ns/bibtex#
n11http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/projekt/
n8http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n22http://linked.opendata.cz/resource/domain/vavai/subjekt/
n20http://linked.opendata.cz/ontology/domain/vavai/
n5http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F11%3A00180659%21RIV12-MSM-21240___/
n12http://linked.opendata.cz/resource/domain/vavai/zamer/
n7https://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/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n18http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n21http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n16http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n13http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F11%3A00180659%21RIV12-MSM-21240___
rdf:type
skos:Concept n20:Vysledek
dcterms:description
Stringology is a part of Computer Science dealing with processing strings and sequences. It finds many important applications in various fields used by Information Society. Biological sequences processing is one of the most important fields. On the other hand the finite automata theory is a well developed formal system used for a long time in the area of compiler construction. The chapter aims to show various approaches of the finite automata use in Stringology. The approaches are demonstrated on practical examples. Of course it is impossible to describe all the approaches as it would be out of scope of the chapter. However, we would like to present basic approaches that the reader can modify and combine to a given task. Stringology is a part of Computer Science dealing with processing strings and sequences. It finds many important applications in various fields used by Information Society. Biological sequences processing is one of the most important fields. On the other hand the finite automata theory is a well developed formal system used for a long time in the area of compiler construction. The chapter aims to show various approaches of the finite automata use in Stringology. The approaches are demonstrated on practical examples. Of course it is impossible to describe all the approaches as it would be out of scope of the chapter. However, we would like to present basic approaches that the reader can modify and combine to a given task.
dcterms:title
Finite Automata in Pattern Matching Finite Automata in Pattern Matching
skos:prefLabel
Finite Automata in Pattern Matching Finite Automata in Pattern Matching
skos:notation
RIV/68407700:21240/11:00180659!RIV12-MSM-21240___
n20:predkladatel
n22:orjk%3A21240
n3:aktivita
n14:Z n14:P
n3:aktivity
P(GA201/09/0807), Z(MSM6840770014)
n3:dodaniDat
n13:2012
n3:domaciTvurceVysledku
n8:9170367
n3:druhVysledku
n21:C
n3:duvernostUdaju
n10:S
n3:entitaPredkladatele
n5:predkladatel
n3:idSjednocenehoVysledku
199786
n3:idVysledku
RIV/68407700:21240/11:00180659
n3:jazykVysledku
n18:eng
n3:klicovaSlova
bioinformatics; finite automata; pattern matching
n3:klicoveSlovo
n6:finite%20automata n6:pattern%20matching n6:bioinformatics
n3:kontrolniKodProRIV
[10F39D23D3FB]
n3:mistoVydani
New York
n3:nazevZdroje
Algorithms in Computational Molecular Biology: Techniques, Approaches and Applications
n3:obor
n16:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetStranKnihy
1044
n3:pocetTvurcuVysledku
1
n3:projekt
n17:GA201%2F09%2F0807
n3:rokUplatneniVysledku
n13:2011
n3:tvurceVysledku
Holub, Jan
n3:zamer
n12:MSM6840770014
s:numberOfPages
21
n19:hasPublisher
J. Willey
n7:isbn
978-0-470-50519-9
n11:organizacniJednotka
21240