By Topic

DSAPSO: DNA sequence assembly using continuous Particle Swarm Optimization with Smallest Position Value rule

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Verma, R.S. ; Dept. of Electr. Eng., Nat. Inst. of Technol., Raipur, India ; Kumar, S.

DNA sequence assembly is one of the most popular problems in molecular biology. DNA sequence assembly refers to aligning and merging fragments of a much longer DNA sequence in order to reconstruct the original sequence. There are many solutions provided by researchers. In this paper we have adopted the features of the Particle Swarm Optimization (PSO) algorithm with Smallest Position Value (SPV) rule and designed a sequential algorithm to solve DNA sequence assembly and named it DSAPSO. DNA sequence assembly problem is a discrete optimization problem, so there is need of discrete optimization algorithm to solve it. We use continuous version of PSO with SPV rule to solve the DNA sequence assembly problem. SPV rule transforms continuous version of PSO to discrete version. To check the efficiency of proposed methodology the results of DSAPSO is compared with the results of genetic algorithm (GA).

Published in:

Recent Advances in Information Technology (RAIT), 2012 1st International Conference on

Date of Conference:

15-17 March 2012