Pilot corpus: NIH-funded biomedical datasets. Any DOI can be scored on demand — network effects sharpen as coverage grows.

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph

Bioinformatics(2017)10.1093/bioinformatics/btx261Source: DataRank Database

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph is a research paper published in Bioinformatics (2017). On theSindex it has a DataRank of 0.564. It has been cited 42 times.

N/A

0.564DataRank · unranked

Scored on demand from live citation data

42 citations

Download PDF

Cite:

Linked data & code

gen

DataRank reads this dataset's downstream impact straight off the citation graph — no black box, no proprietary weighting. How is this computed?

›Methodology & internals

datarank_citation_only_1hop_v6· scope data_onlyMethodology

Pipeline:MetadataData-paper checkEnrichmentCitation networkScoring

Enrichment:Funding (11 grants)OA: hybridTopics (18)Linked Datasets (3)DataCite Reuse (3)IDs (PubMed, PMC)Annotations (1)

FAIR Checklist

Context only (not used in score)

Findable (2/2)

Has DOI
Indexed in repositories

Accessible (0/2)

Interoperable (2/2)

DataCite relations
Linked datasets

Reusable (0/3)

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

Run a calibrated FAIR evaluation for this paper →

We only score data papers we can read in full — never from an abstract alone.

DataRank Breakdown

Base Score 100%Citation Network 0%

Base Score Contribution

0.564

From this paper's citation signal

Citation Network Contribution

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 →

Authors (4)

Michael A Bender,Rob Johnson ORCID,Rob Patro ORCID,Prashant Pandey ORCID

Live enrichment

PubMed:28881995 PMC:PMC5870571

National Science Foundation

Grant: BBSRC-NSF/BIO-1564917

National Science Foundation

Grant: IIS-1247726

National Science Foundation

Grant: IIS-1251137

National Science Foundation

Grant: CNS-1408695

National Science Foundation

Grant: CCF-1439084

National Science Foundation

Grant: CCF-1617618

National Science Foundation

Grant: 1251137

BIGDATA: Small: DCM: Collaborative Research: An efficient, versatile, scalable, and portable storage system for scientific data containers

National Science Foundation

Grant: 1247726

BIGDATA: Mid-Scale: DCM: Collaborative Research: Eliminating the Data Ingestion Bottleneck in Big Data Applications

National Science Foundation

Grant: 1408695

CSR: Medium: Collaborative Research: FTFS: A Read/Write-Optimized Fractal Tree File System

National Science Foundation

Grant: 1439084

XPS: FULL: CCA: Collaborative Research: Cache-Adaptive Algorithms: How to Share Core among Many Cores

Sandia National Laboratories

Influential Citations

hybridLicense: cc-by-nc

HYBRIDhttps://academic.oup.com/bioinformatics/article-pdf/33/14/i133/25157228/btx261.pdf

publisherhttps://academic.oup.com/bioinformatics/article-pdf/33/14/i133/25157228/btx261.pdf

publisherhttps://academic.oup.com/bioinformatics/article-pdf/33/14/i133/50315096/bioinformatics_33_14_i133.pdf

repositoryhttps://www.osti.gov/biblio/1430372

repositoryhttps://www.ncbi.nlm.nih.gov/pmc/articles/5870571

Fields of Study

Computer ScienceMedicineBiology0301 basic medicine03 medical and health sciences0206 medical engineering02 engineering and technology

MeSH Terms

Gene Expression ProfilingSequence Analysis, RNAComputational BiologyAlgorithmsSoftware

Keywords

Sequence Analysis, RNAGene Expression ProfilingComputational BiologyIsmb/Eccb 2017: The 25th Annual Conference Intelligent Systems for Molecular Biology Held Jointly with the 16th Annual European Conference on Computational Biology, Prague, Czech Republic, July 21–25, 2017AlgorithmsSoftware

Additional file 7 of Simplitigs as an efficient and scalable representation of de Bruijn graphs

10.6084/m9.figshare.14379368.v1figshare

Additional file 7 of Simplitigs as an efficient and scalable representation of de Bruijn graphs

10.6084/m9.figshare.14379368figshare

Compressed Weighted de Bruijn Graphs

10.4230/lipics.cpm.2021.16Schloss Dagstuhl – Leibniz-Zentrum für Informatik

deBGR: an efficient and near-exact representation of the weighted de Bruijn graph

FAIR Checklist

DataRank Breakdown

Authors (4)

Funding (11 grants)

Impact

Open Access

Topics

Linked Datasets (3)

Annotations (Europe PMC)