The Research Of Sequence Alignment In Bioinformatics

With the accomplishment of Human Genome Project, a mass of original data are collected by researchers. In order to handle and research those data better, more and more modern computational technologies have been utilized into biology. And then a new crossing discipline Bioinformatics comes into being. In this field, sequence alignment is the most fundamental researching method. How to obtain better results of sequence alignment efficiently is one of the important and hot topics in bioinformatics.This paper introduces the correlative concepts and research methods about sequence alignment and bioinformatics firstly. Secondly, it researches the classical sequence alignment algorithms such as dynamic programming algorithm, Smith-Waterman, BLAST, FASTA, progressive sequence alignment algorithm. And then, we bring forward a pair-wise sequence alignment algorithm named BSDP based on segment-segment and dynamic programming, which employs n-tuple strategy to find high identical segment-segment in long sequence regions and employs dynamic programming algorithm to align sequences in short sequence regions recursively. In the last chapter, it expatiates a dot matrix plot procedure "DotWin", which can operate friendly, quickly and easily, while most of dot matrix plot procedures are run in DOS and inconvenient for researchers.