(2016). A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems. , 42(1), 64-67.
. "A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems". , 42, 1, 2016, 64-67.
(2016). 'A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems', , 42(1), pp. 64-67.
A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems. , 2016; 42(1): 64-67.

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

Iraqi Journal for Computers and Informatics ijci
Article 1, Volume 42, Issue 1, 2016, Pages 64-67
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.
Keywords
A Binary; PARTICLE; Swarm; algorithm; A Simple; Mutation; Operator; Phylogenies; Problems
Statistics
Article View: 88
PDF Download: 49


Journal Management System. Powered by iJournalPro.com