TY - JOUR ID - TI - A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems AU - PY - 2016 VL - 42 IS - 1 SP - 64 EP - 67 JO - Iraqi Journal for Computers and Informatics المجلة العراقية للحاسبات والمعلوماتية SN - 2313190X 25204912 AB - Manipulating a huge amount of data sets makes the mechanism of searching very difficult to find the best features combinations in phylogenetic tree construction. This article has proposed a binary particle swarm optimization algorithm that randomly selects chloroplast genes to construct phylogenetic trees. Also, a simple mutation operator the article has suggested to speed up the search and facilitate the search process to find the best chloroplast genes combinations. These combinations can be evaluated according to the bootstrap values of all the nodes of the constructed tree.

ER -