About: The Finite Automata Approaches for Bioinformatics

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: The Finite Automata Approaches for Bioinformatics Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
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. (en)
Title	The Finite Automata Approaches for Bioinformatics The Finite Automata Approaches for Bioinformatics (en)
skos:prefLabel	The Finite Automata Approaches for Bioinformatics The Finite Automata Approaches for Bioinformatics (en)
skos:notation	RIV/68407700:21240/12:00195772!RIV13-MSM-21240___
http://linked.open...avai/riv/aktivita	I P S
http://linked.open...avai/riv/aktivity	I, P(GA201/09/0807), S
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Holub, Jan
http://linked.open.../riv/druhVysledku	D - Článek ve sborníku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta informačních technologií
http://linked.open...dnocenehoVysledku	136601
http://linked.open...ai/riv/idVysledku	RIV/68407700:21240/12:00195772
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	finite automata; bioinformatics (en)
http://linked.open.../riv/klicoveSlovo	bioinformatics finite automata
http://linked.open...ontrolniKodProRIV	[E222D1BDCEA9]
http://linked.open...v/mistoKonaniAkce	Praha
http://linked.open...i/riv/mistoVydani	Praha
http://linked.open...i/riv/nazevZdroje	Proceedings of 22nd Theorietag Automata and Formal Languages
http://linked.open...in/vavai/riv/obor	IN
http://linked.open...ichTvurcuVysledku	1 (xsd:int)
http://linked.open...cetTvurcuVysledku	1 (xsd:int)
http://linked.open...vavai/riv/projekt	String and tree analysis and processing
http://linked.open...UplatneniVysledku	2012
http://linked.open...iv/tvurceVysledku	Holub, Jan
http://linked.open...vavai/riv/typAkce	EUR - Evropská
http://linked.open.../riv/zahajeniAkce	2012-10-03 (xsd:date)
number of pages	2 (xsd:int)
http://purl.org/ne...btex#hasPublisher	Matfyzpress
https://schema.org/isbn	978-80-7378-221-4
http://localhost/t...ganizacniJednotka	21240

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 77 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software