|
|
Travelling Salesman Problem
Kolář, Adam ; Rozman, Jaroslav (referee) ; Zbořil, František (advisor)
The aim of this bachelor's thesis is to design a testing environment for the traveling salesman problem and compare the effectiveness of different approaches to the solution. The first part discussed the possibility of genetic algorithms, depending on the setting of a crossover, mutations and population size. In the second part, there is the same problem using two types of neural networks. The representative of the self-learning net was chosen Kohonen neural network. Hopfield neural network represents a method of minimizing the energy function with fixed coefficients. At both neural networks, there were described possible advantages and disadvantages. In the end, all the findings were interpreted in a global context.
|
|
|
Genetic programming - Java implementation
Tomaštík, Marek ; Kuba,, Martin (referee) ; Matoušek, Radomil (advisor)
This Master´s thesis implements computer program in Java, useful for automatic model generating, specially in symbolic regression problem. Thesis includes short description of genetic programming (GP) and own implementation with advanced GP operands (non-destructive operations, elitism, exptression reduction). Mathematical model is generating by symbolic regression, exacly for choosen data set. For functioning check are used test tasks. Optimal settings is found for choosen GP parameters.
|
|
|
Cardiac IKs channel: rate-dependence of the current magnitude
Kachan, Ksenia ; Čmiel, Vratislav (referee) ; Bébarová,, Markéta (advisor)
This diploma thesis deals with study of the rate-dependence of the magnitude of a current through the heart channel that conducts slowly activating component of delayed rectifier outward current (IKs). This property is very important for the IKs channel function. When other repolarizing currents are insufficient, but also when the heart rate accelerates, especially during elevated sympathetic tone, IKs provides so-called repolarization reserve, which prevents excessive lengthening of cardiac action potential repolarization. The IKs channel structure is encoded by the KCNQ1 (pore-forming -subunit) and KCNE1 (modulatory -subunit) genes. Mutations in these genes disrupt the physiological function of the IKs channel and cause inherited arrhythmogenic syndromes, especially long QT syndrome (LQTS). Such mutations include the c.926C>T (p.T309I) mutation in the KCNQ1 gene, which results in LQTS type 1 in heterozygous carriers. The theoretical part of the thesis provides basic information about the IKs channel and the patch clamp technique, this knowledge is necessary for the practical part. The experimental part is focused on cultivation of the CHO cell line and its transient transfection for subsequent electrophysiological measurements by whole-cell patch clamp technique to study the dependence of the IKs magnitude on stimulation frequency, both in the wild type channels (i.e. without mutation) and in those with cotransfected wild type and T309I subunits.
|
|
|
Optimization of Processes in Logistics with Visualization Support
Kršák, Martin ; Bidlo, Michal (referee) ; Křivka, Zbyněk (advisor)
The master thesis aims to design, implement, and compare algorithms that optimize processes in logistics, mainly in the planning phase. Heuristics and approximation genetic algorithms will find an near-optimal solution to NP-hard problem, such as the traveling salesman problem, with a delay less than several hours. The role of this algorithm is to plan an efficient route for garbage trucks that collect and distribute large-scale waste to waste yards in a specific city. The goal of the optimization is to minimize the shipping costs.
|
|
|
The global optimalization methods
Dudová, Aneta ; Kozumplík, Jiří (referee) ; Mézl, Martin (advisor)
This bachelor work is dedicated to advanced methods of global optimization, and especially problem traveling salesman. It focuses on the description of the problem and its various options, including graph theory, heuristic algorithms, evolutionary algorithms, in which mainly genetic algorithms and optimization by ant colonies. In conclusion, the implementation of these methods and performed testing on different data sets of algorithms that approximately solve the traveling salesman problem.
|
|
|
Prediction of the Effect of Mutation on Protein Solubility
Velecký, Jan ; Martínek, Tomáš (referee) ; Hon, Jiří (advisor)
The goal of the thesis is to create a predictor of the effect of a mutation on protein solubility given its initial 3D structure. Protein solubility prediction is a bioinformatics problem which is still considered unsolved. Especially a prediction using a 3D structure has not gained much attention yet. A relevant knowledge about proteins, protein solubility and existing predictors is included in the text. The principle of the designed predictor is inspired by the Surface Patches article and therefore it also aims to validate the results achieved by its authors. The designed tool uses changes of positive regions of the electric potential above the protein's surface to make a prediction. The tool has been successfully implemented and series of computationally expensive experiments have been performed. It was shown that the electric potential, hence the predictor itself too, can be successfully used just for a limited set of proteins. On top of that, the method used in the article correlates with a much simpler variable - the protein's net charge.
|
|
|
Genetic Algorithms - Multi-core CPU Implementation
Studnička, Vladimír ; Kuba, Martin (referee) ; Matoušek, Radomil (advisor)
his diploma thesis deals with creating the most universal library of genetic algorithms in C++, as much as possible, implemented with the certain number of universal operators, and then with testing created library on some examples. Library must support multi-core processors, implementation will be done over OpenMP. The library will be tested on three examples in all. The first two examples are mathematical functions, that are used just for genetic algorithms testing. Last problem for test is N-Queens problem. Finally we will use genetic algorithms to try find solution for Eternity II puzzle, there is declared a 2 million bounty for full solution.
|
|
|
Development of Meta-Server for Prediction of Mutations Effects on Protein Function
Lisák, Peter ; Burgetová, Ivana (referee) ; Jaša, Petr (advisor)
This bachelor thesis deals with analysis of genomic data, more specifically prediction of effects of mutations on protein function using a protein sequence or tertiary structure. The theoretical introduction describes the basics of genetics and bioinformatics and is followed by description of selected prediction tools such as SIFT, MAPP and AUTO-MUTE. A unified interface for work with different tools is proposed in the thesis. The meta-server interface allows running a computation and collecting results from one site. meta-server combines results of implemented tools and provides a consensual prediction, which is expected to be more accurate than the results from individual tools. Finally, testing of meta-server on the real data and comparisons of predictions with the experimentally obtained results are presented.
|
|
|
Functional Annotation of Nucleotide Polymorphism Using Evolution Strategy
Šalanda, Ondřej ; Martínek, Tomáš (referee) ; Bendl, Jaroslav (advisor)
This thesis brings a new approach to the prediction of the the effect of amino acid substitution. The main goal is to create a new meta-tool, which combines evaluations of eight already implemented prediction tools. The use of weighted consensus over those tools should lead to better accuracy and versatility of prediction. The novelty of developed tool lies in involving evolution strategy with experimentally defined parameters as a way to determine the best weight distribution. At the end, a complex comparison and evaluation of results is given.
|
|
|
Analysis of TP53 gene transcriptional varians in human leucemic cells
Vlahová, Veronika ; Mgr.Diana Grochová, Ph.D. (referee) ; Malčíková,, Jitka (advisor)
The theoretical part of the thesis summarizes general information about the human TP53 gene and p53 protein, which is encoded by this gene. There is also dealt with the transcriptional variants - p53 isoforms. The experimental part is focused on the detection of isoform p53 and its shorter, yet undescribed form. The starting material is peripheral blood of patients from University Hospital Brno, from which RNA was isolated. Subsequently, RNA was transcribed by reverse transcription into cDNA which was amplified by polymerase chain reaction (PCR). Experimental measurements demonstrate that p53 occurs in all the B-lymphocytes of patients with chronic lymphocytic leukemia. It also demonstrats the existence of a shorter form of p53.
|
guest ::
