Nature-inspired novel Cuckoo Search Algorithm for genome sequence assembly
Autor: | S. Uma Maheswari, G. Subashini, R Indumathy |
---|---|
Rok vydání: | 2015 |
Předmět: | |
Zdroj: | Sadhana. 40:1-14 |
ISSN: | 0973-7677 0256-2499 |
DOI: | 10.1007/s12046-014-0300-3 |
Popis: | This study aims to produce a novel optimization algorithm, called the Cuckoo Search Algorithm (CS), for solving the genome sequence assembly problem. Assembly of genome sequence is a technique that attempts to rebuild the target sequence from the collection of fragments. This study is the first application of the CS for DNA sequence assembly problem in the literature. The algorithm is based on the levy flight behaviour and brood parasitic behaviour. The CS algorithm is employed to maximize the overlap score by reconstructing the original DNA sequence. Experimental results show the ability of the CS to find better optimal genome assembly. To check the efficiency of the proposed technique the results of the CS is compared with one of the well known evolutionary algorithms namely, particle swarm optimization (PSO) and its variants. |
Databáze: | OpenAIRE |
Externí odkaz: |