"Proceedings of 22nd Theorietag Automata and Formal Languages" . "The Finite Automata Approaches for Bioinformatics"@en . . "The Finite Automata Approaches for Bioinformatics" . "RIV/68407700:21240/12:00195772!RIV13-MSM-21240___" . "[E222D1BDCEA9]" . . "21240" . "1"^^ . "The Finite Automata Approaches for Bioinformatics" . . . . . . "2"^^ . "Holub, Jan" . . . "978-80-7378-221-4" . "2012-10-03+02:00"^^ . . "The Finite Automata Approaches for Bioinformatics"@en . . "I, P(GA201/09/0807), S" . "RIV/68407700:21240/12:00195772" . "Praha" . "Praha" . "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 . . . . . "136601" . . "finite automata; bioinformatics"@en . "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." . . . "Matfyzpress" . "1"^^ .