Publication Type:

Conference Paper

Source:

ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol I, Springer, Volume 248 VOLUME I, p.241-250 (2014)

URL:

http://link.springer.com/chapter/10.1007/978-3-319-03107-1_27

Abstract:

Parallel Genetic algorithms have proved to be a successful method for solving the protein folding problem. In this paper we propose a simple genetic algorithm with optimum population size, mutation rate and selection strategy which is parallelized with MapReduce architecture for finding the optimal conformation of a protein using the two dimensional square HP model. We have used an enhanced framework for map Reduce which increased the performance of the private clouds in distributed environment. The proposed Genetic Algorithm was tested several bench mark of synthetic sequences. The result shows that GA converges to the optimum state faster than the traditional.

Notes:

cited By 1

Cite this Research Publication

A. G. Hari Narayanan, Krishnakumar, U., and Judy, M. V., “An enhanced MapReduce framework for solving protein folding problem using a parallel genetic algorithm”, in ICT and Critical Infrastructure: Proceedings of the 48th Annual Convention of Computer Society of India-Vol I, 2014, vol. 248 VOLUME I, pp. 241-250.

207
PROGRAMS
OFFERED
5
AMRITA
CAMPUSES
15
CONSTITUENT
SCHOOLS
A
GRADE BY
NAAC, MHRD
8th
RANK(INDIA):
NIRF 2018
150+
INTERNATIONAL
PARTNERS