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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	BioSystems Ročník 150; s. 35 - 45
Hlavní autori:	Hughes, James Alexander, Houghten, Sheridan, Ashlock, Daniel
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Ireland Elsevier B.V 01.12.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!