A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems

Authors

  • Reem Alsrraj University of Information Technology and Communications (UOITC)

DOI:

https://doi.org/10.25195/ijci.v42i1.86

Keywords:

Phylogenetic tree, Mutation, combinations.

Abstract

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.

Downloads

Download data is not yet available.

Downloads

Published

2016-12-31