Experiments

Searchable full-text extractions: founding hypothesis, core claims, experimental setups, key results and statistics — pulled out of each paper as structure. Search a cell line, an assay or an entity (e.g. HUH7) and find every paper that worked with it. This corpus stands on its own: most entries carry no reproduction assessment (yet).

• Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features.

  PMID 37509188 · PMC10377046 · Biomolecules · 2023 · 8 claims · 3 setups

  Has reproduction · 89

  Graph Random Forest (GRF) embeds graph/network information directly into the decision-tree building process by splitting on features in the k-hop neighborhood of a data-driven head-splitting node.

  scale-free non-small embryonic simulation rna-seq

• Iterative class discovery and feature selection using Minimal Spanning Trees.

  PMID 15355552 · PMC520744 · BMC bioinformatics · 2004 · 7 claims · 5 setups

  Full-text index only

  Iterating between MST-based clustering and t-statistic feature selection removes noise genes step-wise while sharpening the sample clustering

  simulated breast acute diffuse synthetic cdna microarray

• Net positive charge of HIV-1 CRF01_AE V3 sequence regulates viral sensitivity to humoral immunity.

  PMID 18787705 · PMC2527523 · PloS one · 2008 · 8 claims · 5 setups

  Full-text index only

  Reduction in V3's net positive charge makes V3 less variable due to limited positive selection

  hiv-1 recombinant plasma gp120 sequence single-round v3-peptide-based