Evidence map›Paper›PMID 37399256›Full record

ArticleGenome research2023

Efficient mapping of accurate long reads in minimizer space with mapquik.

Bariş Ekim, Kristoffer Sahlin, Paul Medvedev, Bonnie Berger, Rayan Chikhi

Open access · bronzeAbstract read
In one paragraph

Article in Genome research, 2023. 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
–field-weighted citation impact
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. bronko: ultrafast, alignment-free detection of viral genome variation.bioRxiv : the preprint server for biology · 2026
    Article
  5. Article
  6. Review
  7. Article
  8. Article
  9. Review
  10. Article
  11. Review
  12. Article
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

5 authors at 4 institutions in 3 countries.

Bariş EkimComputer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts 02139, USA.ORCID 0000-0002-4040-403X
Kristoffer SahlinDepartment of Mathematics, Science for Life Laboratory, Stockholm University, SE-106 91 Stockholm, Sweden.ORCID 0000-0001-7378-2320
Paul MedvedevDepartment of Computer Science and Engineering, The Pennsylvania State University, University Park, Pennsylvania 16802, USA.ORCID 0000-0003-3143-594X
Bonnie BergerComputer Science and Artificial Intelligence Laboratory (CSAIL), Massachusetts Institute of Technology (MIT), Cambridge, Massachusetts 02139, USA.ORCID 0000-0002-2724-7228
Rayan ChikhiDepartment of Computational Biology, Institut Pasteur, 75015 Paris, France bab@mit.edu rchikhi@pasteur.fr.ORCID 0000-0003-1099-8735
IIT@MIT · USInstitut Pasteur · FRPennsylvania State University · USStockholm University · SE

Funding

Privacy-preserving genomic medicine at scaleR01HG010959 · NHGRI · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BERGER, BONNIE · 2020 to 2023
$2.6M
Leveraging k-mer sketching statistics to enhance metagenomic methods and alignment algorithmsR01GM146462 · NIGMS · PENNSYLVANIA STATE UNIVERSITY, THE · PI Antonio Blanca Pimentel, David Koslicki · 2022 to 2026
$2.2M
Manifold representations and active learning for 21 st century biologyR35GM141861 · NIGMS · MASSACHUSETTS INSTITUTE OF TECHNOLOGY · PI BERGER, BONNIE · 2021 to 2025
$1.9M
NHGRI NIH HHS R01 HG010959NIGMS NIH HHS R01 GM146462NIGMS NIH HHS R35 GM141861
6 · The paper itself

Abstract

DNA sequencing data continue to progress toward longer reads with increasingly lower sequencing error rates. We focus on the critical problem of mapping, or aligning, low-divergence sequences from long reads (e.g., Pacific Biosciences [PacBio] HiFi) to a reference genome, which poses challenges in terms of accuracy and computational resources when using cutting-edge read mapping approaches that are designed for all types of alignments. A natural idea would be to optimize efficiency with longer seeds to reduce the probability of extraneous matches; however, contiguous exact seeds quickly reach a sensitivity limit. We introduce mapquik, a novel strategy that creates accurate longer seeds by anchoring alignments through matches of

Indexed as

High-Throughput Nucleotide SequencingSoftwareAlgorithmsGenome, HumanHumansSequence Analysis, DNA

Identifiers

PMID37399256
PMCPMC10538364
OpenAlexW4382680160

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC
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.