Study On Genetic Sequence Comparison Algorithm Based On Genetic Algorithm

Sequence alignment is an important and active research field in bioinformatics,and is the basis of bioinformatics research.DNA is a genetic material in organism which act as a medium to inherit genetic information from the previous generation to the next generation.All organisms(except for very few viruses)are evolved from their common ancestors through DNA,proving that DNA sequence is the basic requirement in bioinformatics.However,DNA sequencing is now being carried out by high-throughput sequencing machines,producing billions of sequenced base data every day.The advent of next-generation sequencing technology has multiplied the sequencing of DNA sequences and reduced the cost of sequencing at several orders of magnitude.Most of the nucleotide databases have a large number of redundant primordial data generated by experiments.Compare to sequencing technology,structural determination is time-consuming and difficult to adapt to the new generation of sequencing methods,which leads to the hysteresis of sequence function determination and structural analysis.Therefore,it is crucial to study various high-performance systems analysis methods to improve the structure and function of nucleotide sequences.Sequence alignment is the first step in bioinformatics to understand an unknown sequence of molecular systems.To find out a more efficient and accurate multiple sequence alignment algorithm is the hotspot,and the most difficult key issue in biology research.Until now,genetic algorithms is widely used among bio-researchers.In their research,they find that genetic algorithms have great optimization space in solving the efficiency and accuracy of multiple sequence alignment,and have achieved a certain degree of optimization.In this paper,under the background of the completed studies of multiple sequence alignment algorithm,we hope to provide some reference ideas and research results for future researchers.In this paper start with an introduction of the basic knowledge of DNA sequence alignment,then explain explicitly about the related knowledge of genetic algorithm,simulated annealing algorithm and dynamic programming algorithm.This paper is focusing on the research of genetic algorithm.On the basis of the standard genetic algorithm,the architecture of the whole genetic algorithm is redesigned.The algorithm gives up the binary coding which is not suitable for large number of data coding,uses two-dimensional chromosome coding,crosswise crosswise and cross crosswise of single point crosswise and multiple crosswise crosswise two crosswise ways to get the best method.Finally,the solution of the genetic algorithm is simulated and dynamic programming operation is carried out.By analyzing the experimental data,comparing the efficiency of multiple sequence alignment between the improved genetic algorithm?the standard genetic algorithm and other algorithms,we find the algorithm with the best performance.