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

Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences

Bioinformatics(2016)10.1093/bioinformatics/btw152Source: DataRank Database

Minimap and miniasm: fast mapping and de novo assembly for noisy long sequences is a research paper published in Bioinformatics (2016). On theSindex it has a DataRank of 1.1. It has been cited 1,705 times.

N/A
1.1DataRank · unranked
1.1
Open Access1705 citations · base score 7.4
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

MotivationSingle Molecule Real-Time (SMRT) sequencing technology and Oxford Nanopore technologies (ONT) produce reads over 10 kb in length, which have enabled high-quality genome assembly at an affordable cost. However, at present, long reads have an error rate as high as 10-15%. Complex and computationally intensive pipelines are required to assemble such reads.ResultsWe present a new mapper, minimap and a de novo assembler, miniasm, for efficiently mapping and assembling SMRT and ONT reads without an error correction stage. They can often assemble a sequencing run of bacterial data into a single contig in a few minutes, and assemble 45-fold Caenorhabditis elegans data in 9 min, orders of magnitude faster than the existing pipelines, though the consensus sequence error rate is as high as raw reads. We also introduce a pairwise read mapping format and a graphical fragment assembly format, and demonstrate the interoperability between ours and current tools.Availability and implementationhttps://github.com/lh3/minimap and https://github.com/lh3/[email protected] 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.1

      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(2018)
      co-citedsame journal
      10.1093/bioinformatics/bty191
      Bioinformatics(2009)
      co-citedsame journal
      10.1093/bioinformatics/btp352
      Science(2001)
      co-cited
      10.1126/science.1058040
      Nature Methods(2012)
      co-cited
      10.1038/nmeth.1923