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

Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences

Proceedings of the National Academy of Sciences(2021)10.1073/pnas.2016239118Source: DataRank Database

Biological structure and function emerge from scaling unsupervised learning to 250 million protein sequences is a research paper published in Proceedings of the National Academy of Sciences (2021). On theSindex it has a DataRank of 1.2. It has been cited 2,999 times. Its calibrated FAIR score is 80/100.

N/A
1.2DataRank · unranked
1.2
Open Access2999 citations · base score 8.0
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

In the field of artificial intelligence, a combination of scale in data and model capacity enabled by unsupervised learning has led to major advances in representation learning and statistical generation. In the life sciences, the anticipated growth of sequencing promises unprecedented data on natural sequence diversity. Protein language modeling at the scale of evolution is a logical step toward predictive and generative artificial intelligence for biology. To this end, we use unsupervised learning to train a deep contextual language model on 86 billion amino acids across 250 million protein sequences spanning evolutionary diversity. The resulting model contains information about biological properties in its representations. The representations are learned from sequence data alone. The learned representation space has a multiscale organization reflecting structure from the level of biochemical properties of amino acids to remote homology of proteins. Information about secondary and tertiary structure is encoded in the representations and can be identified by linear projections. Representation learning produces features that generalize across a range of applications, enabling state-of-the-art supervised prediction of mutational effect and secondary structure and improving state-of-the-art features for long-range contact prediction.

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.

      80FAIR score
      F Findable
      100
      A Accessible
      70
      I Interoperable
      100
      R Reusable
      50
      Top 1% by FAIRdeterministic✓ full text read

      Calibrated FAIR score — a parallel quality metric, independent of the DataRank citation score. See the full evaluation →

      DataRank Breakdown

      Base Score 100%Citation Network 0%

      Base Score Contribution

      1.2

      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 (11)

      Joshua MeierORCID,Tom SercuORCID,Siddharth Goyal,Zeming LinORCID,Jason LiuORCID

      Related Papers (10)

      Array programming with NumPy
      N/A
      1.5DataRank · unranked
      Nature(2020)
      co-cited
      10.1038/s41586-020-2649-2
      The Protein Data Bank
      Top 1%
      32.3DataRank
      Nucleic Acids Research(2000)
      co-cited
      10.1093/nar/28.1.235
      Deep learning
      N/A
      1.7DataRank · unranked
      Nature(2015)
      co-cited
      10.1038/nature14539
      International Journal of Computer Vision(2015)
      co-cited
      10.1007/s11263-015-0816-y
      Proceedings of the National Academy of Sciences(2008)
      co-citedsame journal
      10.1073/pnas.0704422105
      Nature Communications(2019)
      co-cited
      10.1038/s41467-018-07931-2