Evidence map›Paper›PMID 35041518›Full record

ArticleJournal of computational biology : a journal of computational molecular cell biology2022

Finding Maximal Exact Matches Using the r-Index.

Massimiliano Rossi, Marco Oliva, Paola Bonizzoni, Ben Langmead, Travis Gagie, Christina Boucher

Abstract read
In one paragraph

Article in Journal of computational biology : a journal of computational molecular cell biology, 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 5 papers.

0numbers the graph read from it
0cells of the map it votes in
5citing 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

5 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. Suffix sorting via matching statistics.Algorithms for molecular biology : AMB · 2024
    Article
  5. Finding maximal exact matches in graphs.Algorithms for molecular biology : AMB · 2024
    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

6 authors.

Massimiliano RossiDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, USA.ORCID 0000-0002-3012-1394
Marco OlivaDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, USA.ORCID 0000-0003-0525-3114
Paola BonizzoniDepartment of Informatics, Systems and Communication, University of Milano-Bicocca, Milano, Italy.ORCID 0000-0001-7289-4988
Ben LangmeadDepartment of Computer Science, Johns Hopkins University, Baltimore, Maryland, USA.ORCID 0000-0003-2437-1976
Travis GagieFaculty of Computer Science, Dalhousie University, Halifax, Canada.ORCID 0000-0003-3689-327X
Christina BoucherDepartment of Computer and Information Science and Engineering, University of Florida, Gainesville, Florida, USA.ORCID 0000-0001-9509-9725

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

Efficiently finding maximal exact matches (MEMs) between a sequence read and a database of genomes is a key first step in read alignment. But until recently, it was unknown how to build a data structure in [Formula: see text] space that supports efficient MEM finding, where

Indexed as

AlgorithmsSoftwareComputational BiologyDatabases, GeneticGenome, HumanGenomicsHumansSequence AlignmentSequence Analysis, DNAMEM findingr-indexrun-length-encoded Burrows–Wheeler transformthresholds

Identifiers

PMID35041518
PMCPMC8902461

What OpenQuestion holds

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