Evidence map›Paper›PMID 35758776›Full record

ArticleBioinformatics (Oxford, England)2022

Syotti: scalable bait design for DNA enrichment.

Jarno N Alanko, Ilya B Slizovskiy, Daniel Lokshtanov, Travis Gagie, Noelle R Noyes, Christina Boucher

Open access · hybridAbstract read
In one paragraph

Article in Bioinformatics (Oxford, England), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 12 papers.

0numbers the graph read from it
0cells of the map it votes in
12citing papers in PubMed
1.1field-weighted citation impact, top 24% of its field
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

12 citing papers in PubMed, 15 citations in OpenAlex.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Review
  8. OLTA: Optimizing bait seLection for TArgeted sequencing.Bioinformatics (Oxford, England) · 2025
    Article
  9. Article
  10. Article
  11. Review
  12. Review
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

6 authors at 4 institutions in 3 countries.

Jarno N AlankoDepartment of Computer Science, University of Helsinki, Helsinki, Finland.
Ilya B SlizovskiyDepartment of Veterinary Population Medicine, University of Minnesota, St. Paul, MN, USA.
Daniel LokshtanovDepartment of Computer Science, University of California, Santa Barbara, CA, USA.
Travis GagieFaculty of Computer Science, Dalhousie University, Halifax, Canada.
Noelle R NoyesDepartment of Veterinary Population Medicine, University of Minnesota, St. Paul, MN, USA.
Christina BoucherDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, FL, USA.
Dalhousie University · CAUniversity of Minnesota · USUniversity of California, Santa Barbara · USUniversity of Florida · US

Funding

Personal and panel references for improved alignmentR01HG011392 · NHGRI · JOHNS HOPKINS UNIVERSITY · PI LANGMEAD, BENJAMIN THOMAS · 2020 to 2025
$4.2M
Developing Computational Methods for Surveillance of Antimicrobial Resistant AgentsR01AI141810 · NIAID · UNIVERSITY OF FLORIDA · PI BOUCHER, CHRISTINA, PROSPERI, MATTIA · 2019 to 2023
$2.1M
NHGRI NIH HHS R01 HG011392NIAID NIH HHS R01 AI141810
6 · The paper itself

Abstract

motivationBait 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.

resultsWe 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.

Indexed as

AlgorithmsSoftwareDNAHumansMetagenomicsSequence Analysis, DNADNA

Identifiers

PMID35758776
PMCPMC9235489
OpenAlexW4226119586

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.