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
n18http://linked.opendata.cz/ontology/domain/vavai/riv/typAkce/
dctermshttp://purl.org/dc/terms/
n22http://purl.org/net/nknouf/ns/bibtex#
n8http://localhost/temp/predkladatel/
n17http://linked.opendata.cz/resource/domain/vavai/riv/tvurce/
n12http://linked.opendata.cz/resource/domain/vavai/projekt/
n20http://linked.opendata.cz/resource/domain/vavai/subjekt/
n11http://linked.opendata.cz/ontology/domain/vavai/
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#
n21http://linked.opendata.cz/resource/domain/vavai/vysledek/RIV%2F68407700%3A21240%2F12%3A00195772%21RIV13-MSM-21240___/
n9http://linked.opendata.cz/ontology/domain/vavai/riv/klicoveSlovo/
n5http://linked.opendata.cz/ontology/domain/vavai/riv/duvernostUdaju/
xsdhhttp://www.w3.org/2001/XMLSchema#
n19http://linked.opendata.cz/ontology/domain/vavai/riv/aktivita/
n14http://linked.opendata.cz/ontology/domain/vavai/riv/jazykVysledku/
n15http://linked.opendata.cz/ontology/domain/vavai/riv/druhVysledku/
n10http://linked.opendata.cz/ontology/domain/vavai/riv/obor/
n7http://reference.data.gov.uk/id/gregorian-year/

Statements

Subject Item
n2:RIV%2F68407700%3A21240%2F12%3A00195772%21RIV13-MSM-21240___
rdf:type
n11:Vysledek skos:Concept
dcterms:description
Stringology is a computer science on string and sequence processing. Finite automata can solve efficiently many tasks in stringology. An overview of four approaches of the finite automata use in stringology is presented: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. The way the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables) is also shown. Those approaches and complex alphabet use are demonstrated in various tasks of bioinformatics. The tasks work with sequences on various alphabets: DNA, RNA, amino acids. The searched patterns may be explicitly defined or may be defined by their properties. Some patterns may allow errors some must match exactly. Some pattern symbols may match exactly one symbol, some may match a subset of alphabet as they were not read exactly or their practical behaviour is the same. Stringology is a computer science on string and sequence processing. Finite automata can solve efficiently many tasks in stringology. An overview of four approaches of the finite automata use in stringology is presented: deterministic finite automaton, deterministic simulation of nondeterministic finite automaton, finite automaton as a model of computation, and compositions of finite automata solutions. The way the finite automata can process strings build over more complex alphabet than just single symbols (degenerate symbols, strings, variables) is also shown. Those approaches and complex alphabet use are demonstrated in various tasks of bioinformatics. The tasks work with sequences on various alphabets: DNA, RNA, amino acids. The searched patterns may be explicitly defined or may be defined by their properties. Some patterns may allow errors some must match exactly. Some pattern symbols may match exactly one symbol, some may match a subset of alphabet as they were not read exactly or their practical behaviour is the same.
dcterms:title
The Finite Automata Approaches for Bioinformatics The Finite Automata Approaches for Bioinformatics
skos:prefLabel
The Finite Automata Approaches for Bioinformatics The Finite Automata Approaches for Bioinformatics
skos:notation
RIV/68407700:21240/12:00195772!RIV13-MSM-21240___
n11:predkladatel
n20:orjk%3A21240
n3:aktivita
n19:I n19:S n19:P
n3:aktivity
I, P(GA201/09/0807), S
n3:dodaniDat
n7:2013
n3:domaciTvurceVysledku
n17:9170367
n3:druhVysledku
n15:D
n3:duvernostUdaju
n5:S
n3:entitaPredkladatele
n21:predkladatel
n3:idSjednocenehoVysledku
136601
n3:idVysledku
RIV/68407700:21240/12:00195772
n3:jazykVysledku
n14:eng
n3:klicovaSlova
finite automata; bioinformatics
n3:klicoveSlovo
n9:finite%20automata n9:bioinformatics
n3:kontrolniKodProRIV
[E222D1BDCEA9]
n3:mistoKonaniAkce
Praha
n3:mistoVydani
Praha
n3:nazevZdroje
Proceedings of 22nd Theorietag Automata and Formal Languages
n3:obor
n10:IN
n3:pocetDomacichTvurcuVysledku
1
n3:pocetTvurcuVysledku
1
n3:projekt
n12:GA201%2F09%2F0807
n3:rokUplatneniVysledku
n7:2012
n3:tvurceVysledku
Holub, Jan
n3:typAkce
n18:EUR
n3:zahajeniAkce
2012-10-03+02:00
s:numberOfPages
2
n22:hasPublisher
Matfyzpress
n16:isbn
978-80-7378-221-4
n8:organizacniJednotka
21240