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

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...

Full description

Bibliographic Details
Main Author: Reem Alsrraj
Format: Article
Language:Arabic
Published: University of Information Technology and Communications 2016-12-01
Series:Iraqi Journal for Computers and Informatics
Subjects:
Online Access:http://ijci.uoitc.edu.iq/index.php/ijci/article/view/86
id doaj-ae794279e6324adba8ca48e71b34dc15
record_format Article
spelling doaj-ae794279e6324adba8ca48e71b34dc152020-11-25T03:46:59ZaraUniversity of Information Technology and CommunicationsIraqi Journal for Computers and Informatics2313-190X2520-49122016-12-01421646710.25195/ijci.v42i1.8686A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies ProblemsReem Alsrraj0 University of Information Technology and Communications (UOITC)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.http://ijci.uoitc.edu.iq/index.php/ijci/article/view/86phylogenetic tree, mutation, combinations.
collection DOAJ
language Arabic
format Article
sources DOAJ
author Reem Alsrraj
spellingShingle Reem Alsrraj
A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
Iraqi Journal for Computers and Informatics
phylogenetic tree, mutation, combinations.
author_facet Reem Alsrraj
author_sort Reem Alsrraj
title A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
title_short A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
title_full A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
title_fullStr A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
title_full_unstemmed A Binary Particle Swarm Algorithm with A Simple Mutation Operator for Solving Phylogenies Problems
title_sort binary particle swarm algorithm with a simple mutation operator for solving phylogenies problems
publisher University of Information Technology and Communications
series Iraqi Journal for Computers and Informatics
issn 2313-190X
2520-4912
publishDate 2016-12-01
description 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.
topic phylogenetic tree, mutation, combinations.
url http://ijci.uoitc.edu.iq/index.php/ijci/article/view/86
work_keys_str_mv AT reemalsrraj abinaryparticleswarmalgorithmwithasimplemutationoperatorforsolvingphylogeniesproblems
AT reemalsrraj binaryparticleswarmalgorithmwithasimplemutationoperatorforsolvingphylogeniesproblems
_version_ 1724504072882487296