Abstract
Constructing a phylogenetic tree is a typical NP-complete problem. To avoid the premature problem and the slow convergence of stand genetic algorithm (SGA), This paper puts forward a heuristic searching strategy which combinative adaptive genetic algorithm and simulated annealing algorithm to determine the maximum parsimony tree's topology. The crossover probability and mutation probability of the algorithm adaptive based on population diversity, at the same time annealing operator introduced to the self-adaptive genetic algorithm, by annealing operator to further ensure the diversity of individuals. The experimental result shows that the improved accuracy and computing efficiency of the algorithm are greatly enhanced.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
