Your browser doesn't support javascript.
loading
Syotti: scalable bait design for DNA enrichment.
Alanko, Jarno N; Slizovskiy, Ilya B; Lokshtanov, Daniel; Gagie, Travis; Noyes, Noelle R; Boucher, Christina.
Afiliação
  • Alanko JN; Department of Computer Science, University of Helsinki, Helsinki, Finland.
  • Slizovskiy IB; Faculty of Computer Science, Dalhousie University, Halifax, Canada.
  • Lokshtanov D; Department of Veterinary Population Medicine, University of Minnesota, St. Paul, MN, USA.
  • Gagie T; Department of Computer Science, University of California, Santa Barbara, CA, USA.
  • Noyes NR; Faculty of Computer Science, Dalhousie University, Halifax, Canada.
  • Boucher C; Department of Veterinary Population Medicine, University of Minnesota, St. Paul, MN, USA.
Bioinformatics ; 38(Suppl 1): i177-i184, 2022 06 24.
Article em En | MEDLINE | ID: mdl-35758776
MOTIVATION: Bait enrichment is a protocol that is becoming increasingly ubiquitous as it has been shown to successfully amplify regions of interest in metagenomic samples. In this method, a set of synthetic probes ('baits') are designed, manufactured and applied to fragmented metagenomic DNA. The probes bind to the fragmented DNA and any unbound DNA is rinsed away, leaving the bound fragments to be amplified for sequencing. Metsky et al. demonstrated that bait-enrichment is capable of detecting a large number of human viral pathogens within metagenomic samples. RESULTS: We formalize the problem of designing baits by defining the Minimum Bait Cover problem, show that the problem is NP-hard even under very restrictive assumptions, and design an efficient heuristic that takes advantage of succinct data structures. We refer to our method as Syotti. The running time of Syotti shows linear scaling in practice, running at least an order of magnitude faster than state-of-the-art methods, including the method of Metsky et al. At the same time, our method produces bait sets that are smaller than the ones produced by the competing methods, while also leaving fewer positions uncovered. Lastly, we show that Syotti requires only 25 min to design baits for a dataset comprised of 3 billion nucleotides from 1000 related bacterial substrains, whereas the method of Metsky et al. shows clearly super-linear running time and fails to process even a subset of 17% of the data in 72 h. AVAILABILITY AND IMPLEMENTATION: https://github.com/jnalanko/syotti. SUPPLEMENTARY INFORMATION: Supplementary data are available at Bioinformatics online.
Assuntos

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Assunto principal: Algoritmos / Software Tipo de estudo: Guideline Limite: Humans Idioma: En Revista: Bioinformatics Assunto da revista: INFORMATICA MEDICA Ano de publicação: 2022 Tipo de documento: Article País de afiliação: Finlândia

Texto completo: 1 Coleções: 01-internacional Base de dados: MEDLINE Assunto principal: Algoritmos / Software Tipo de estudo: Guideline Limite: Humans Idioma: En Revista: Bioinformatics Assunto da revista: INFORMATICA MEDICA Ano de publicação: 2022 Tipo de documento: Article País de afiliação: Finlândia