The System Of Display And Analysis Of Gene Sequence

Bioinformatics is a crossing discipline which contains all aspects of disposing,storage,distributing,analysising and explaining of biological information, using mathematics,computer science and all technologys of biology to illustrate and understand the life activities in a great deal of datum. Sequence alignment is the foundation and precondition of bioinformatics research, and it is the basic method of kinds of sequence analysis task, providing valuable informatins for Genetic Sciences such as Expecting the functions & structures of Protein, discovering the Evolutionary Relationships and developing new medicine. But this is still an unsettled problem in the Computed Molecular Biology yet. It is proved that sequence alignment is a NP-Complete problem, it is a challenging task. In practice appliance, the scale of sequence alignment is large, and it takes time. Along with the increasing of sequence datas in biology sequence database, providing extensive foreground for life science research, bringing rigorous challenges to the capacity of disposing biological data now. It seems very instancy to exploit an algorithm with high sensitivity and high efficiency.In recent years, with the increasing of gene sequence, the graphical representation is becoming an important means for studing gene sequences. So how to give effective graphical representation of gene sequences, to classify genes and to study the phylogenetic relationships are the important problems in Bioinformatics. This thesis is research in the graphical representation of DNA sequences,gene sequence alignment and constructing evolutionary tree.We have done the research as follows:(1) Simply introducing several frequently-used typical graphical representation of gene sequences, mainly researching the Z curve theory raise by Zhang Chun-Ting academician in Tinjin University, and using the Non-uniform B-spline Curves in Graphics to fit Z curves;(2) Analysising the statistical characteristics parameter of characters and geometrical characteristics parameter of Z curves of gene sequences;(3) Simply introducing the classical algorithms of sequence alignment, specially discussing the Dynamic Programming Algorithm which is the earliest raised and the most basic algorithm of gene sequence alignment, it is declared by Needleman and Wunsch in 1970, and it's time complexity is too high, we stressly research using the distance of Z curves' geometrical center to contrast the similarity between gene sequences;(4) Using the Neighbor-joining algorithm declared by Saitou and Nei in 1987 based on the distance matrix of Z curves' geometrical center construct the evolutionary tree of common 11 species and 39 species, and the accuracy rate reaching 90 percent.