Linking De Novo Assembly Results with Long DNA Reads Using the dnaasm-link Application
Wiktor Kuśmirek , W. Franus , Robert Marek Nowak
AbstractCurrently, third-generation sequencing techniques, which make it possible to obtain much longer DNA reads compared to the next-generation sequencing technologies, are becoming more and more popular. There are many possibilities for combining data from next-generation and third-generation sequencing. Herein, we present a new application called dnaasm-link for linking contigs, the result ofde novoassembly of second-generation sequencing data, with long DNA reads. Our tool includes an integrated module to fill gaps with a suitable fragment of an appropriate long DNA read, which improves the consistency of the resulting DNA sequences. This feature is very important, in particular for complex DNA regions. Our implementation is found to outperform other state-of-the-art tools in terms of speed and memory requirements, which may enable its usage for organisms with a large genome, something which is not possible in existing applications. The presented application has many advantages: (i) it significantly optimizes memory and reduces computation time; (ii) it fills gaps with an appropriate fragment of a specified long DNA read; (iii) it reduces the number of spanned and unspanned gaps in existing genome drafts. The application is freely available to all users under GNU Library or Lesser General Public License version 3.0 (LGPLv3). The demo application, Docker image, and source code can be downloaded from project homepage.
|Journal series||BioMed Research International, [Journal of Biomedicine and Biotechnology], ISSN 1110-7243, [1110-7251, 2314-6133, 2314-6141]|
|Publication size in sheets||0.5|
|ASJC Classification||; ; ; ; ; ; ;|
|Score||= 70.0, 17-12-2019, ArticleFromJournal|
|Publication indicators||= 0; = 0; : 2016 = 0.875; : 2018 = 2.197 (2) - 2018=2.885 (5)|
* presented citation count is obtained through Internet information analysis and it is close to the number calculated by the Publish or Perish system.