A New Model of Genetic Algorithm Using a Bipartite Graph and the Action of Largest Subgroup of Dihedral Group Dn on Invariance Markov Basis, n is a Multiple of 6
Journal: International Journal of Science and Research (IJSR) (Vol.3, No. 12)Publication Date: 2014-12-05
Authors : Husein Hadi Abbass; Hussein Salman Mohammed Hussein;
Page : 542-554
Keywords : Computational algebraic statistics; sufficient statistics; bipartite graph; dihedral group; Markov basis;
Abstract
In this paper, we introduce a new model of genetic algorithm that permutes the pieces of nucleotides in aligned DNA sequences using a bipartite graph and the action of largest subgroup H of dihedral Group D_n, n is multiple of 6 on (n^2-3n) /33n/3 - contingency tables with fixed two dimensional marginals and their Markov basis n such that B is H-invariant,. Where n is the Markov basis found by H. H. Abbass and H. S. Mohammed Hussein in [7].
Other Latest Articles
- The Enhancement of Scripted in the Development of Cloned Sheep Embryos
- Implementation of Fixed-Point LMS Adaptive Filter with Efficient Area-Power-Delay
- Knowledge Fusion Technique Using Classifier Ensemble by Combining the Sets of Classification Rules
- Review On: Advanced and Robust Personalized Mobile Search Engine
- Privacy Preserving System Using Attribute Based Encryption for e-Health Cloud
Last modified: 2021-06-30 21:15:01