Title: GAPWA: genetic algorithm using pair wise alignment method for solving MSA problem

Authors: Rohit Kumar Yadav; Haider Banka

Addresses: Department of Computer Science and Engineering, IIT(ISM), Dhanbad-826004, India ' Department of Computer Science and Engineering, IIT(ISM), Dhanbad-826004, India

Abstract: In bioinformatics, multiple sequence alignment is an NP-hard problem. Hence, bio-inspired techniques can be used to approximate the solution. In the current study, a hybrid genetic algorithm has been proposed to solve multiple sequence alignment problems i.e., termed as GAPWA. In which, two new mechanism have been proposed. First one is for initial population generation, and another for crossover and mutation operation. In the initial population generation, Needleman Wunsch pair wise method is adopted. In the second mechanism, modified crossover and mutation operation is used. In the performance analysis, GAPWA is compared with some of the well-known existing methods such as PRRP, DIALIGN, HMMT, SB-PIMA, GA, SAGA, and RBT-GA on a number of benchmark datasets from Bali-base 2.0. The obtained results show that the proposed approach GAPWA achieves better solutions compared to existing approaches in most of the cases.

Keywords: multiple sequence alignment; MSA; genetic algorithms; GAs; pair-wise alignment; PWA; dynamic programming; bioinformatics; sequences.

DOI: 10.1504/IJCONVC.2016.082023

International Journal of Convergence Computing, 2016 Vol.2 No.2, pp.130 - 143

Accepted: 16 Aug 2016
Published online: 01 Feb 2017 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article