Berlin, Freie Universiẗat, Diss., 2002. / Erscheinungsjahr an der Haupttitelstelle: 2002. - Dateiformat: zip, Dateien im PDF-Format.

Techn. Universiẗat, Diss., 2005--Berlin.

Diss. phil.-hist. Bern (kein Austausch). / Literaturverz.

Universiẗat, Diss., 2005--Freiburg (Breisgau).

Modification of DNA sequences and their suitable representation is important part of analysis, comparison and another processing. Goal of this paper is finding of suitable methods for representation of genomic and proteomic sequences. Because there is great number of metods, this paper will introduce only some of them. All selected methods, are described in the first part of this paper and they were programed in Matlab. Selected methods are illustrated on coding sequences of the first exon of the b-globin gene of 11 different species. Results are compared withresults from the original papers. Some methods are capable of another processing like cluster analysis. Output of this paper is comparison of results, gained from different methods, and finding the most suitable one.

Work on determining the genetic diversity of biological signal aligning DNA sequences, will address a brief description of the composition of DNA. Following is basic information on the bioinformatics analysis. Then the work will describe the possibility of aligning DNA sequences. Work will focus primarily on global Needleman-Wunsch algorithm and local Smit - Watermanovův algorithm. Furthermore, this work will focus on aligning DNA sequences using methods CGR and FCGR. At the end of the work will describe the practical application of identifying genetic differences by aligning the sequences.

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.

This paper describes sequence alignment algorithms of nucleotide sequences. There are described pairwise alignment algorithms using database search or dynamic programming. Then in the paper is description of dynamic programming for multiple sequences and algorithm that builds phylogenetic trees. At the end of the first part of the paper is the description of technology FPGA. In the second part that is more practical is described implemntation of the choosen one algorithm. This part includes also examples of some multiple alignments.

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.

This master's thesis consider clustering of protein sequences based on primary structure of proteins. Studies the protein sequences from they primary structure. Describes methods for similarities in the amino acid sequences of proteins, cluster analysis and clustering algorithms. This thesis presents concept of distance function based on similarity of protein sequences and implements clustering algorithms ANGES, k-means, k-medoids in Python programming language.