|
|
Jumping Language Models
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.
|
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
|
|
Jumping Language Models
Ošmera, Lubomír ; Kocman, Radim (referee) ; Meduna, Alexandr (advisor)
The main goal of this master thesis is introduction and investigation of extended version of jumping automata and grammars. New versions are primarily focused on bioinformatic applications - DNA computing. This thesis examine their power and other properties of new models and makes comparison with existing computer science models. Then thesis demontrates practical applications, specifically amino acid and protein detections inside DNA sequence and makes comparision with existing tools in DNA computing for example Mark´s probabilistic models.
|
|
|
Demonstration of Tree Controlled Grammars Properties
Kunštátský, Martin ; Čermák, Martin (referee) ; Koutný, Jiří (advisor)
Tree controlled grammars are grammars regulated by restriction placed on its derivation trees. It is simple and natural extension of context-free grammars. There are several types of derivation tree control, two principles are mentioned in this work: horizontal and vertical control. Application demonstrating tree controlled grammars properties, implemented in Python programming language, is also part of this work.
|
guest ::
