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

Using Bayesian Networks to Analyze Expression Data

Journal of Computational Biology(2000)10.1089/106652700750050961Source: DataRank Database

Using Bayesian Networks to Analyze Expression Data is a research paper published in Journal of Computational Biology (2000). On theSindex it has a DataRank of 1.2. It has been cited 3,318 times. Its calibrated FAIR score is 61/100.

N/A
1.2DataRank · unranked
1.2
3318 citations · base score 8.1
Cite:
datarank_citation_only_1hop_v6· scope data_onlyMethodology

Abstract

DNA hybridization arrays simultaneously measure the expression level for thousands of genes. These measurements provide a "snapshot" of transcription levels within the cell. A major challenge in computational biology is to uncover, from such measurements, gene/protein interactions and key biological features of cellular systems. In this paper, we propose a new framework for discovering interactions between genes based on multiple expression measurements. This framework builds on the use of Bayesian networks for representing statistical dependencies. A Bayesian network is a graph-based model of joint multivariate probability distributions that captures properties of conditional independence between variables. Such models are attractive for their ability to describe complex stochastic processes and because they provide a clear methodology for learning from (noisy) observations. We start by showing how Bayesian networks can describe interactions between genes. We then describe a method for recovering gene interactions from microarray data using tools for learning Bayesian networks. Finally, we demonstrate this method on the S. cerevisiae cell-cycle measurements of Spellman et al. (1998).

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

FAIR Checklist

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

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

        61FAIR score
        F Findable
        100
        A Accessible
        70
        I Interoperable
        50
        R Reusable
        25
        Top 7% by FAIRdeterministic⚠ abstract only
        Estimated from the abstract only. The agent couldn't read this paper's full text, so body-dependent criteria (data-availability statement, formats, license) are inferred. For a confident score, upload the PDF or supply full text →

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

        Michal Linial,Iftach NachmanORCID,Paul A. ReyfmanORCID,Nir FriedmanORCID

        Related Papers (10)

        Proceedings of the National Academy of Sciences(2001)
        co-cited
        10.1073/pnas.091062498
        Nature Methods(2012)
        co-cited
        10.1038/nmeth.2016
        Proceedings of the National Academy of Sciences(2001)
        co-cited
        10.1073/pnas.211566398
        Nucleic Acids Research(2000)
        co-cited
        10.1093/nar/28.1.27