Restarting and recentering genetic algorithm variations for DNA fragment assembly: The necessity of a multi-strategy approach

DNA Fragment assembly – an NP-Hard problem – is one of the major steps in of DNA sequencing. Multiple strategies have been used for this problem, including greedy graph-based algorithms, deBruijn graphs, and the overlap-layout-consensus approach. This study focuses on the overlap-layout-consensus ap...

Full description

Saved in:

Bibliographic Details
Published in:	BioSystems Vol. 150; pp. 35 - 45
Main Authors:	Hughes, James Alexander, Houghten, Sheridan, Ashlock, Daniel
Format:	Journal Article
Language:	English
Published:	Ireland Elsevier B.V 01.12.2016
Subjects:	Algorithms Animals Artificial Intelligence DNA - genetics DNA fragment assembly problem DNA Fragmentation Evolutionary algorithm Humans Island Model Recentering-restarting Representation Ring Species Sequence Analysis, DNA - methods Representation DNA fragment assembly problem Island Model Evolutionary algorithm Recentering-restarting Ring Species
ISSN:	0303-2647, 1872-8324
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!