The IRMA Community
Newsletters
Research IRM
Click a keyword to search titles using our InfoSci-OnDemand powered search:
|
DNA Fragment Assembly Using Quantum-Inspired Genetic Algorithm
Abstract
DNA fragment assembly (DFA) is one of the most important and challenging problems in computational biology. DFA problem involves reconstruction of target DNA from several hundred (or thousands) of sequenced fragments by identifying the proper orientation and order of fragments. DFA problem is proved to be a NP-Hard combinatorial optimization problem. Metaheuristic techniques have the capability to handle large search spaces and therefore are well suited to deal with such problems. In this chapter, quantum-inspired genetic algorithm-based DNA fragment assembly (QGFA) approach has been proposed to perform the de novo assembly of DNA fragments using overlap-layout-consensus approach. To assess the efficacy of QGFA, it has been compared genetic algorithm, particle swarm optimization, and ant colony optimization-based metaheuristic approaches for solving DFA problem. Experimental results show that QGFA performs comparatively better (in terms of overlap score obtained and number of contigs produced) than other approaches considered herein.
Related Content
|
M. Suchetha, Jaya Sai Kotamsetti, Dasapalli Sasidhar Reddy, S. Preethi, D. Edwin Dhas.
© 2024.
14 pages.
|
|
A. Bhuvaneswari, R. Srivel, N. Elamathi, S. Shitharth, K. Sangeetha.
© 2024.
15 pages.
|
|
Srinivas Kumar Palvadi.
© 2024.
28 pages.
|
|
Srinivas Kumar Palvadi.
© 2024.
20 pages.
|
|
Nitika Kapoor, Parminder Singh, Kusrini M. Kom, Vishal Bharti.
© 2024.
19 pages.
|
|
M. Suchetha, V. V. Rama Raghavan, Shaik Fardeen, P. V. S. Nithish, S. Preethi, D. Edwin Dhas.
© 2024.
13 pages.
|
|
Damandeep Kaur, Shamandeep Singh, Simarjeet Kaur, Gurpreet Singh, Rani Kumari.
© 2024.
17 pages.
|
|
|