Graph algorithms for DNA sequencing : origins, current models and the future
Year of publication: |
1 February 2018
|
---|---|
Authors: | Błażewicz, Jacek ; Kasprzak, Marta ; Kierzynka, Michal ; Frohmberg, Wojciech ; Swiercz, Aleksandra ; Wojciechowski, Pawel ; Zurkowski, Piotr |
Published in: |
European journal of operational research : EJOR. - Amsterdam : Elsevier, ISSN 0377-2217, ZDB-ID 243003-4. - Vol. 264.2018, 3 (1.2.), p. 799-812
|
Subject: | DNA de novo assembly | Graph algorithms | Whole genome sequencing | Graphentheorie | Graph theory | Algorithmus | Algorithm | Scheduling-Verfahren | Scheduling problem |
-
Assembly sequence planning based on a hybrid particle swarm optimisation and gentic algorithm
Xing, Yanfeng, (2012)
-
Thevenin, Simon, (2017)
-
Madraki, Golshan, (2018)
- More ...
-
The simplified partial digest problem : approximation and a graph-theoretic model
Błażewicz, Jacek, (2011)
-
A hyper-heuristic approach to sequencing by hybridization of DNA sequences
Blazewicz, Jacek, (2013)
-
Unified encoding for hyper-heuristics with application to bioinformatics
Swiercz, Aleksandra, (2014)
- More ...