DOI

Motivation: The recently developed barcoding-based synthetic long read (SLR) technologies have already found many applications in genome assembly and analysis. However, although some new barcoding protocols are emerging and the range of SLR applications is being expanded, the existing SLR assemblers are optimized for a narrow range of parameters and are not easily extendable to new barcoding technologies and new applications such as metagenomics or hybrid assembly. Results: We describe the algorithmic challenge of the SLR assembly and present a cloudSPAdes algorithm for SLR assembly that is based on analyzing the de Bruijn graph of SLRs. We benchmarked cloudSPAdes across various barcoding technologies/applications and demonstrated that it improves on the state-of-the-art SLR assemblers in accuracy and speed.

Язык оригиналаанглийский
Номер статьиbtz349
Страницы (с-по)i61-i70
Число страниц10
ЖурналBioinformatics
Том35
Номер выпуска14
Дата раннего онлайн-доступа5 июл 2019
DOI
СостояниеОпубликовано - 15 июл 2019

    Предметные области Scopus

  • Вычислительная математика
  • Молекулярная биология
  • Биохимия
  • Теория вероятности и статистика
  • Прикладные компьютерные науки
  • Математика и теория расчета

ID: 49523355