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...
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 |
Similar Items
-
ZIKA-How fast does this virus mutate?
by: Ian S. LOGAN
Published: (2016-03-01) -
Phylogenetic supertree methods
by: Swenson, Michelle Dawn
Published: (2014) -
Fishing for significance in phylogenies: too many alternatives for the same outcome, or an appeal to Journal editors
by: Jorge Oscar Chiapella, et al.
Published: (2014-02-01) -
The Bourque distances for mutation trees of cancers
by: Beerenwinkel, N., et al.
Published: (2021) -
The Bourque distances for mutation trees of cancers
by: Katharina Jahn, et al.
Published: (2021-06-01)