🏆 Finalist — NIH Data Sharing Index (“S-Index”) Challenge
Demo corpus. Scores are computed on a select set of biomedical paper/datasets and may be inaccurate for papers outside this corpus — DataRank relies on network effects that improve with scale. We aim to expand this into a fully open resource pending additional funding.

Minimap2: pairwise alignment for nucleotide sequences

Bioinformatics(2018)10.1093/bioinformatics/bty191Source: DataRank Database

Minimap2: pairwise alignment for nucleotide sequences is a research paper published in Bioinformatics (2018). On theSindex it has a DataRank of 1.5. It has been cited 16,325 times.

N/A
1.5DataRank · unranked
1.5
Open Access16325 citations · base score 9.7
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

MotivationRecent advances in sequencing technologies promise ultra-long reads of ∼100 kb in average, full-length mRNA or cDNA reads in high throughput and genomic contigs over 100 Mb in length. Existing alignment programs are unable or inefficient to process such data at scale, which presses for the development of new alignment algorithms.ResultsMinimap2 is a general-purpose alignment program to map DNA or long mRNA sequences against a large reference database. It works with accurate short reads of ≥100 bp in length, ≥1 kb genomic reads at error rate ∼15%, full-length noisy Direct RNA or cDNA reads and assembly contigs or closely related full chromosomes of hundreds of megabases in length. Minimap2 does split-read alignment, employs concave gap cost for long insertions and deletions and introduces new heuristics to reduce spurious alignments. It is 3-4 times as fast as mainstream short-read mappers at comparable accuracy, and is ≥30 times faster than long-read genomic or cDNA mappers at higher accuracy, surpassing most aligners specialized in one type of alignment.Availability and implementationhttps://github.com/lh3/minimap2.Supplementary informationSupplementary data are available at Bioinformatics online.

Data sources & pipeline
Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring
Enrichment:Pending

FAIR Checklist

Context only (not used in score)
Findable (1/2)
  • Has DOI
Accessible (1/2)
  • Open Access
Interoperable (0/2)
    Reusable (0/3)

      FAIR checklist signals are shown for context only and do not affect DataRank scoring.

      DataRank Breakdown

      Base Score 100%Citation Network 0%

      Base Score Contribution

      1.5

      From this paper's citation signal

      Citation Network Contribution

      0

      Citation network not refreshed for this result

      This paper's DataRank is currently driven only by its base citation score. Citation network data was not refreshed for this result.

      Learn more about DataRank methodology →
      Why this DataRank?

      DataRank blends this paper's own citation count with the influence of the papers that cite it. Here, roughly 100% comes from its base citations and 0% from the citation network.

      Base score B(p)
      log1p(citation_count) — grows sub-linearly, so a paper with 1,000 citations is not 10× a paper with 100.
      Network N(p)
      Σ over citers of log1p(Cq) ÷ max(outdegreeq, 1). Being cited by a highly-cited paper with few references counts most.
      Damping factor d = 0.85
      DataRank = (1−d)·B(p) + d·N(p) — the two cards above are each already multiplied by their share.
      Self-citations excluded
      Citers sharing any OpenAlex author ID with this paper are filtered out before the network sum.

      Citers are pulled from OpenAlex sorted by cited_by_count:descand capped per paper, so when the cap binds we keep the highest-signal references and the score is reproducible across reruns.

      Read the full methodology →

      Authors (1)

      Related Papers (10)

      Bioinformatics(2009)
      co-citedsame journal
      10.1093/bioinformatics/btp352
      Bioinformatics(2010)
      co-citedsame journal
      10.1093/bioinformatics/btq033
      Twelve years of SAMtools and BCFtools
      N/A
      1.4DataRank · unranked
      GigaScience(2021)
      co-cited
      10.1093/gigascience/giab008