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
Having a BLAST with bioinformatics (and avoiding BLASTphemy).
PMID 11597340 · PMC138974 · Genome biology · 2001 · 8 claims · 4 setups
BLAST is the most widely used tool for searching biological sequences for regions of local similarity
-
Has reproduction · 76
Tracing human genetic histories and natural selection with precise local ancestry inference.
PMID 40379651 · PMC12084304 · Nature communications · 2025 · 7 claims · 7 setups
Orchestra, a two-stage LAI method combining a recombination-distance base layer with a deep learning (convolutional + attention) smoothing module, outperforms RFmix, FLARE and Gnomix in precision and recall across simulated admixture generations.
-
Full-text index only
Ab initio identification of putative human transcription factor binding sites by comparative genomics.
PMID 15865625 · PMC1097714 · BMC bioinformatics · 2005 · 8 claims · 5 setups
An integrated algorithm combining human-mouse genomic comparison, motif overrepresentation, and coregulation filters (GO annotation and microarray coexpression) can identify candidate transcription factor binding sites genome-wide
-
Has reproduction · 53
Monocarboxylate Transporter-2 Expression Restricts Tumor Growth in a Murine Model of Lung Cancer: A Multi-Omic Analysis.
PMID 34638954 · PMC8508890 · International journal of molecular sciences · 2021 · 7 claims · 7 setups
Reduced MCT2 expression promotes increased tumor growth and local invasiveness in a murine TC1 lung carcinoma model
-
Has reproduction · 30
Minimal metabolic pathway structure is consistent with associated biomolecular interactions.
PMID 24987116 · PMC4299494 · Molecular systems biology · 2014 · 8 claims · 8 setups
MinSpan, a mixed-integer linear optimization algorithm, computes the shortest, linearly independent pathways (sparsest basis of the null space of the stoichiometric matrix S) for genome-scale metabolic networks, which convex approaches (extreme pathways, elementary flux modes) cannot do at genome scale.
-
Has reproduction · 100
Whole-genome sequencing of cryopreserved resources from French Large White pigs at two distinct sampling times reveals strong signatures of convergent and divergent selection between the dam and sire lines.
PMID 36864379 · PMC9979506 · Genetics, selection, evolution : GSE · 2023 · 6 claims · 8 setups
French LWD and LWS lines have lost approximately 5% of the SNPs that segregated in the 1977 ancestral population.
-
Full-text index only
Motif discovery in promoters of genes co-localized and co-expressed during myeloid cells differentiation.
PMID 19059999 · PMC2632922 · Nucleic acids research · 2009 · 6 claims · 8 setups
A novel multi-step computational method (built on approximate pattern enumeration, binomial over-representation scoring with FDR correction, and k-medoids clustering) can identify over-represented motifs in a selected set of promoters relative to a background promoter set.
-
Full-text index only
The whole alignment and nothing but the alignment: the problem of spurious alignment flanks.
PMID 18796526 · PMC2566872 · Nucleic acids research · 2008 · 8 claims · 4 setups
Some common scoring schemes tend to overextend alignments, generating spurious alignment flanks up to hundreds of bp/amino acids in length
-
Full-text index only
Inverse symmetry in complete genomes and whole-genome inverse duplication.
PMID 19898631 · PMC2771390 · PloS one · 2009 · 8 claims · 5 setups
Reverse and complement symmetries are essentially absent in genomic sequences at all scales.
-
Full-text index only
Non-linear mapping for exploratory data analysis in functional genomics.
PMID 15661072 · PMC548129 · BMC bioinformatics · 2005 · 8 claims · 8 setups
A relaxation method for non-linear mapping adapts one pair of points per step rather than all points at once, and was originally shown by Chang and Lee to outperform Sammon's mapping in cluster detection effectiveness and computational efficiency.