|
|
Search of the Bacterial Genome Descriptor
Vanek, Roman ; Martínek, Tomáš (referee) ; Burgetová, Ivana (advisor)
This bachelor thesis deals with the investigation of DNA sequences of bacterial genomes. The aim is to find out whether it is possible to determine on the basis of the nucleotide tuple frequencies from which bacteria specie the examined sequence originates. The investigation results were obtained by a tool whose implementation is also a part of the work. The output of this thesis are the experiments with nucleotide tuple frequencies based on statistical calculations and decision whether this approach is beneficial or not.
|
|
|
DNA Fragmnent Assembly
Paulenda, Ján ; Jaša, Petr (referee) ; Burgetová, Ivana (advisor)
The main subject of this Bachelor's thesis is the DNA fragment assembly. The problem is transposed to finding a shortest superstring problem. Different assembly techniques and string aligning methods are introduced in the theoretical part. Programming language Perl, which was used to implement the assembly, is also widely mentioned, along with its features. Last part of the thesis involves tests' statistics of the final implemented solution.
|
|
|
Techniques for Comparing Biological Sequences
Sladký, Roman ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
This work presents the building up of basic biological units DNA, RNA and proteins as well as their function. Provided data are kept in biological databases which are connected worldwide to supply preferable communication along with all kinds of available information to be used in the scientific research. The secret of alive is hidden in genes coded in sequences of nucleotides. Genes enable the creation of proteins which are made of sequences of amino-acids. The wide-spread methods of comparing these sequences are FASTA and BLAST algorithms. Their base is used for the PSProt program which is described in this work. PSProt program is the tool for comparing the sequences of proteins. First it is necessary to synthesise the protein from the DNA oligonucleotide because it codes the surveyed protein. The most similar proteins are searched out by heuristic of hitpoints, then their final score that is essential for aligning is modified by semiglobal alignment algorithm.
|
|
|
Genomic Data Mining Techniques
Jaša, Petr ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
First of all, this thesis sets itself a goal to introduce some common technics for datamining in genomics and as a next step to implement own algorithm like algorithm BLAST. In the concrete, this work is pointed to sequences of DNA. The DNA sequence contains in itself genetic information, which is template for living organism. For explanation this information can be used number of technics. This paper describes algorithm Fasta and algorithms from BLAST family. With these algorithms, it is possible to gain a lot of important information even about such DNA sequences, where only primary structure is known. Principle of these algorithms is based on alignments of one query sequence, which we want to obtain some information from, with many sequences stored in database. According to result alignment, it is possible to determine many features of the query sequence.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
|
|
Development of selected CD markers and their role in the phylogenesis of human immune system
Podolská, Tereza ; Růžičková, Šárka (advisor) ; Vinkler, Michal (referee)
In the first part of the thesis we investigated the origin of selected surface CD markers of human, namely CD19, CD20, CD21, CD24, CD27 and CD38 molecules. In addition, nucleotide and amino acid sequences of these molecules were compared using in silico approach. Bioinformatic databases of sequences of selected molecules at DNA, mRNA and protein level, such as GeneBank, NCBI BLAST, Homologene and OrthoDB, have been used. The intent was to identify at the domain level the first organism in which it is possible to find the searched molecule. At the N-terminal domain of the CD38 of birds, a sequence showing significant similarity to the archaebacterial flagellin domain was found. This flagellin sequence in the CD38 avian molecule is located in the region of transmembrane domain, indicating that the occurrence of this sequence might be related to the formation of the transmembrane domain. The approach used here could be implemented in comparative hybridization studies as a tool in the preparatory non-laboratory phase of the research of the presence of paralogs and orthologs in phylogenetically old species. Keywords: CD marker, immunocyte, B lymphocyte, innate and adaptive immunity, sequence database, amino acid, nucleotide
|
|
|
Genomic Data Mining Techniques
Jaša, Petr ; Křivka, Zbyněk (referee) ; Burgetová, Ivana (advisor)
First of all, this thesis sets itself a goal to introduce some common technics for datamining in genomics and as a next step to implement own algorithm like algorithm BLAST. In the concrete, this work is pointed to sequences of DNA. The DNA sequence contains in itself genetic information, which is template for living organism. For explanation this information can be used number of technics. This paper describes algorithm Fasta and algorithms from BLAST family. With these algorithms, it is possible to gain a lot of important information even about such DNA sequences, where only primary structure is known. Principle of these algorithms is based on alignments of one query sequence, which we want to obtain some information from, with many sequences stored in database. According to result alignment, it is possible to determine many features of the query sequence.
|
|
|
Development of selected CD markers and their role in the phylogenesis of human immune system
Podolská, Tereza ; Růžičková, Šárka (advisor) ; Vinkler, Michal (referee)
In the first part of the thesis we investigated the origin of selected surface CD markers of human, namely CD19, CD20, CD21, CD24, CD27 and CD38 molecules. In addition, nucleotide and amino acid sequences of these molecules were compared using in silico approach. Bioinformatic databases of sequences of selected molecules at DNA, mRNA and protein level, such as GeneBank, NCBI BLAST, Homologene and OrthoDB, have been used. The intent was to identify at the domain level the first organism in which it is possible to find the searched molecule. At the N-terminal domain of the CD38 of birds, a sequence showing significant similarity to the archaebacterial flagellin domain was found. This flagellin sequence in the CD38 avian molecule is located in the region of transmembrane domain, indicating that the occurrence of this sequence might be related to the formation of the transmembrane domain. The approach used here could be implemented in comparative hybridization studies as a tool in the preparatory non-laboratory phase of the research of the presence of paralogs and orthologs in phylogenetically old species. Keywords: CD marker, immunocyte, B lymphocyte, innate and adaptive immunity, sequence database, amino acid, nucleotide
|
|
|
Search of the Bacterial Genome Descriptor
Vanek, Roman ; Martínek, Tomáš (referee) ; Burgetová, Ivana (advisor)
This bachelor thesis deals with the investigation of DNA sequences of bacterial genomes. The aim is to find out whether it is possible to determine on the basis of the nucleotide tuple frequencies from which bacteria specie the examined sequence originates. The investigation results were obtained by a tool whose implementation is also a part of the work. The output of this thesis are the experiments with nucleotide tuple frequencies based on statistical calculations and decision whether this approach is beneficial or not.
|
|
|
Hardware Acceleration of Algorithms for Approximate String Matching
Nosek, Ondřej ; Kořenek, Jan (referee) ; Martínek, Tomáš (advisor)
Methods for aproximate string matching of various sequences used in bioinformatics are crucial part of development in this branch. Tasks are of very large time complexity and therefore we want create a hardware platform for acceleration of these computations. Goal of this work is to design a generalized architecture based on FPGA technology, which can work with various types of sequences. Designed acceleration card will use especially dynamic algorithms like Needleman-Wunsch and Smith-Waterman.
|
guest ::
