Multiple Sequence Alignment by Differential Evolutionary Algorithm with New Mutant

  • Gavarraju* L
  • et al.
N/ACitations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Multiple Sequence Alignment (MSA) is vital in Bioinformatics, helps in finding evolutionary relationships among multiple species. MSA is a NP-complete problem. Though there are a number of tools recent Meta-heuristics are found to be effective in solving MSA problem. Differential Evolutionary Algorithm (DE) is one of the optimization algorithms with various mutants. This work proposes a new mutant for DE, defined using local best and worst chromosomes with current generation population. The performance of the new mutant is evaluated using 50 well known bench mark data sets in sabre (SABMARK v1.65). The results are matched with all the other DE mutants, Genetic Algorithm (GA) and recent Teacher Learner Based Optimization algorithm (TLBO). The proposed DE mutant outperformed all the other DE mutants, GA and TLBO in solving MSA problem.

Cite

CITATION STYLE

APA

Gavarraju*, L. N. Jayaprada., & Pavan, K. K. (2019). Multiple Sequence Alignment by Differential Evolutionary Algorithm with New Mutant. International Journal of Recent Technology and Engineering (IJRTE), 8(4), 9892–9897. https://doi.org/10.35940/ijrte.d9208.118419

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free