Improvement And Optimization Of Algorithms For Constructing Phylogenetic Trees Based On Maximum Parsimony

With the continuous development of bio-techniques and research onphylogenetics, researchers are now facing greater challenges and difficulties whilereconstructing phylogenetic trees. These are caused by:1. increase in the number ofspecies or members of the specific taxon under research;2. the use of a greaternumber of molecular characters. Especially in the era of genome-sequencing,phylogenetic reconstruction based on molecular information requires massivecomputational effort. In this way, mathematical methods, computer technology andother auxiliary means play key roles in enhancing the efficiency and accuracy ofphylogenetic reconstruction. Maximum parsimony is an important and widely usedmethod for phylogenetic reconstruction, and it needs efforts of both biologists andcomputer scientists in order to enhance its computational efficiency.This paper, I summarize basic content and methods of reconstructingphylogenetic trees as used in research both domestic and overseas. I also analyze thecalculation process of maximum parsimony in detail while researching the effect ofpreferences on computational efficiency. Thus from many aspects, allowing therealization of algorithmic improvement and optimization of phylogeneticreconstruction based on maximum parsimony. On High Performance Computingservers, the author did repeated tests with small and large dataset, including simulatedand empirical data using Phylip. The result indicate that the computational efficiencyis highly increased while the computed results remain unchanged. This effectivelyoffers a convenient and swift calculating method for phylogenetic researchers,meeting their demand of analyzing more taxa and longer DNA sequences, takingadvantage of maximum parsimony.