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

A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets

bioRxiv (Cold Spring Harbor Laboratory)(2020)10.1101/2020.01.17.910513Source: DataRank Database

A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets is a research paper published in bioRxiv (Cold Spring Harbor Laboratory) (2020). On theSindex it has a DataRank of 0. It has been cited 11 times.

N/A

0DataRank · unranked

Scored on demand from live citation data

Open Access11 citations

Download PDF

Cite:

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 (1 grants)OA: greenTopics (23)IDs (PubMed, OpenAlex)SDGs (1)

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.

Run a calibrated FAIR evaluation for this paper →

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

Authors (3)

Bonnie Berger ORCID,Yaron Orenstein ORCID,Barış Ekim ORCID

Live enrichment

PubMed:38835399 OpenAlex:https://openalex.org/W2999074280

National Institutes of Health

Grant: 2R01GM081871-05

Structure based prediction of the interactome

Influential Citations

Citation Trend

2020

2021

2022

2023

greenLicense: cc-by-nc-nd

repositoryhttps://www.biorxiv.org/content/biorxiv/early/2020/01/18/2020.01.17.910513.full.pdf

GREENhttps://dspace.mit.edu/bitstream/1721.1/145593/2/2020.01.17.910513v1.full.pdf

repositoryhttps://www.biorxiv.org/content/biorxiv/early/2020/01/18/2020.01.17.910513.full.pdf

publisherhttps://syndication.highwire.org/content/doi/10.1101/2020.01.17.910513

repositoryhttps://doi.org/10.1101/2020.01.17.910513

Fields of Study

Algorithms and Data CompressionGenomics and Phylogenetic StudiesCaching and Content DeliveryMedicineComputer ScienceBiology0301 basic medicine03 medical and health sciences0206 medical engineering02 engineering and technology

Keywords

BottleneckComputer scienceHash functionPashaSequence (biology)Parallel computingSet (abstract data type)AlgorithmLeverage (statistics)Randomized algorithmPerfect hash functionBloom filterHash table

Sustainable Development Goals

SDG 0: Industry, innovation and infrastructure

A randomized parallel algorithm for efficiently finding near-optimal universal hitting sets

FAIR Checklist

Authors (3)

Funding (1 grants)

Impact

Open Access

Topics