Graph algorithms for DNA sequencing - origins, current models and the future
[ 1 ] Instytut Chemii Bioorganicznej Polskiej Akademii Nauk, Polska Akademia Nauk | [ P ] pracownik
2018
artykuł naukowy
angielski
EN With the ubiquitous presence of next-generation sequencing in modern biological, genetic, pharmaceutical and medical research, not everyone pays attention to the underlying computational methods. Even fewer researchers know what were the origins of the current models for DNA assembly. We present original graph models used in DNA sequencing by hybridization, discuss their properties and connections between them. We also explain how these graph models evolved to adapt to the characteristics of next generation sequencing. Moreover, we present a practical comparison of state-of-the-art DNA de novo assembly tools representing these transformed models, i.e. overlap and decomposition-based graphs. Even though the competition is tough, some assemblers perform better and certainly large differences may be observed in hardware resources utilization. Finally, we outline the most important trends in the sequencing field, and try to predict their impact on the computational models in the future. (C) 2016 Elsevier B.V. All rights reserved.
799 - 812
40
40