Thesis Details
Efektivní varianty dynamického programování v bioinformatice
Purpose of this thesis is to study principle of effective algorithms, that are using dynamic programming. Using this knowledge to create application demonstrating principle of effective algorithm of dynamic programming in bioinformatics and write a report summarizing results. Algorithms used in this thesis are solving DNA sequence alignment or RNA secondary structure prediction. These algorithms are compared between themselves based on different input values. For DNA sequence alignment are used algorithms such as Needleman-Wunch and X-drop. For prediction of secondary RNA structure is used Zuker algorithm, that should remove some of Nussin algorithm weaknesses and Nussin algorithm itself. Recursion is showed by recursion trees. Dynamic programming is showed by score matrix. User also have ability to compare speed of both approaches for given sequences. It is programmed as web application, that run on client's side. This ensure easy availability.
dynamic programing, recursion, bioinformatics, DNA sequencing, prediction of secondary RNA structure
Burgetová Ivana, Ing., Ph.D. (DIFS FIT BUT), člen
Grézl František, Ing., Ph.D. (DCGM FIT BUT), člen
Smrčka Aleš, Ing., Ph.D. (DITS FIT BUT), člen
Vašíček Zdeněk, doc. Ing., Ph.D. (DCSY FIT BUT), člen
@bachelorsthesis{FITBT23109,
author = "Jarom\'{i}r Fran\v{e}k",
type = "Bachelor's thesis",
title = "Efektivn\'{i} varianty dynamick\'{e}ho programov\'{a}n\'{i} v bioinformatice",
school = "Brno University of Technology, Faculty of Information Technology",
year = 2020,
location = "Brno, CZ",
language = "czech",
url = "https://www.fit.vut.cz/study/thesis/23109/"
}