An Adaptive Particle Swarm Optimization Algorithm for Solving DNA Fragment Assembly Problem

ISSN: 2212-392X (Online)
ISSN: 1574-8936 (Print)

Volume 12, 6 Issues, 2017

Download PDF Flyer

Current Bioinformatics

This journal supports open access

Aims & ScopeAbstracted/Indexed in

Submit Abstracts Online Submit Manuscripts Online

Yi-Ping Phoebe Chen
Department of Computer Science and Information Technology
La Trobe University

View Full Editorial Board

Subscribe Purchase Articles Order Reprints

Current: 0.77
5 - Year: 0.93

An Adaptive Particle Swarm Optimization Algorithm for Solving DNA Fragment Assembly Problem

Current Bioinformatics, 10(1): 97-105.

Author(s): Indumathy Rajagopal and Uma Maheswari Sankareswaran.

Affiliation: Department of Electronics and Communication Engineering, Coimbatore Institute of Technology, Coimbatore - 641014, Tamilnadu, India.


This paper proposes an efficient method to solve the DNA fragment assembly problem using Adaptive Particle Swarm Optimization (APSO). The DNA fragment assembly for shotgun sequencing has been under study with great significance and complexity. It refers to the arrangement of the fragments in an accurate sequence. This fragment assembly problem is an NP-hard combinatorial optimization problem. In this paper, three different methods namely Constant Inertia Weight (CIW), Dynamically Varying Inertia Weight (DVIW) and An Adaptive Particle Swarm Optimization (APSO) with Smallest Position Value (SPV) rule are proposed to solve the DNA fragment assembly problem. The objective of the proposed method is to obtain the maximum overlapping score by assembling the fragments. Particle swarm optimization algorithm is used to analyze the impact of inertia weight, the cognitive and social components. The PSO algorithm was simulated for each of the methods individually. The experimental results are obvious that the proposed APSO method yields better overlap score when tested with different sized benchmark instances. The proposed APSO method is effective and efficient in assembling the fragments and getting the maximum overlap score when compared to other heuristic techniques.


Adaptive particle swarm optimization, bioinformatics, DNA fragment assembly, inertia weight, smallest position value.

Download Free Order Reprints Order Eprints Rights and Permissions

Article Details

Volume: 10
Issue Number: 1
First Page: 97
Last Page: 105
Page Count: 9
DOI: 10.2174/1574893609666140301001642
Global Biotechnology Congress 2017Drug Discovery and Therapy World Congress 2017

Related Journals

Related eBooks

Webmaster Contact: Copyright © 2017 Bentham Science