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).
-
Full-text index only
Research Spotlight: New multiparameter bioanalytical technologies for applications in personalized medicine, drug discovery and fundamental biology.
PMID 21083072 · PMC3106349 · Bioanalysis · 2009 · 8 claims · 8 setups
High-density arrays of silicon photonic microring resonators enable label-free, multiplexed detection of DNA, miRNA, and protein biomarkers from a single small-volume sample
-
Full-text index only
An analysis of human microRNA and disease associations.
PMID 18923704 · PMC2559869 · PloS one · 2008 · 8 claims · 8 setups
MicroRNAs tend to show similar dysfunctional evidence (both up- or both down-regulated) for diseases within the same disease cluster, and different dysfunctional evidence between different disease clusters.
-
Has reproduction · 88
Transcriptome-wide analyses of piRNA binding sites suggest distinct mechanisms regulate piRNA binding and silencing in C. elegans.
PMID 36737102 · PMC10158993 · RNA (New York, N.Y.) · 2023 · 8 claims · 7 setups
C. elegans piRNAs preferentially bind the coding regions (CDS) of target mRNAs in vivo, rather than 3' UTRs.
-
Has reproduction · 82
Reusable building blocks in biological systems.
PMID 30958230 · PMC6303794 · Journal of the Royal Society, Interface · 2018 · 8 claims · 4 setups
Biological systems can be decomposed into phenotypic building blocks (PBBs) via k-maximally reusable decompositions (k-MRD) that maximize average reusability across conditions.
-
Has reproduction · 89
Graph Random Forest: A Graph Embedded Algorithm for Identifying Highly Connected Important Features.
PMID 37509188 · PMC10377046 · Biomolecules · 2023 · 8 claims · 3 setups
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.