Background The use of novel algorithmic techniques is pivotal to many important problems in life science. For example the sequencing of the human genome (Venter et al., 2001) would not have been possible without advanced assembly algorithms and the development of practical BWT based read mappers have been instrumental for NGS analysis. However, owing to the high speed of technological progress and the urgent need for bioinformatics tools, there was a widening gap between state-of-the-art algorithmic techniques and the actual algorithmic components of tools that are in widespread use. We previously addressed this by introducing the SeqAn library of efficient data types and algorithms in 2008 (Döring et al., 2008). Results The SeqAn library has matured considerably since its first publication 9 years ago. In this article we review its status as an established resource for programmers in the field of sequence analysis and its contributions to many analysis tools. Conclusions We anticipate that SeqAn will continue to be a valuable resource, especially since it started to actively support various hardware acceleration techniques in a systematic manner.
The SeqAn C++ template library for efficient sequence analysis: A resource for programmers / Reinert, Knut; Dadi, Temesgen Hailemariam; Ehrhardt, Marcel; Hauswedell, Hannes; Mehringer, Svenja; Rahn, René; Kim, Jongkyu; Pockrandt, Christopher; Winkler, Jorg; Siragusa, Enrico; URGESE, GIANVITO; Weese, David. - In: JOURNAL OF BIOTECHNOLOGY. - ISSN 0168-1656. - ELETTRONICO. - 261(2017), pp. 157-168. [10.1016/j.jbiotec.2017.07.017]
|Titolo:||The SeqAn C++ template library for efficient sequence analysis: A resource for programmers|
|Data di pubblicazione:||2017|
|Digital Object Identifier (DOI):||http://dx.doi.org/10.1016/j.jbiotec.2017.07.017|
|Appare nelle tipologie:||1.1 Articolo in rivista|
File in questo prodotto:
|1-s2.0-S0168165617315420-main_post_print_editor.pdf||Articolo principale||2a Post-print versione editoriale / Version of Record||Visibile a tuttiVisualizza/Apri|