MétaCan
Menu
Back to cohort
Record W2162193618 · doi:10.2174/1875036200802010080

Modeling Cooperative Gene Regulation Using Fast Orthogonal Search

2008· article· en· W2162193618 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

VenueThe Open Bioinformatics Journal · 2008
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenomics and Chromatin Dynamics
Canadian institutionsQueen's University
FundersLawrence Berkeley National Laboratory
KeywordsMotif (music)Saccharomyces cerevisiaeComputer scienceComputational biologyTranscription factorGeneGene regulatory networkBiologyGene expressionGenetics

Abstract

fetched live from OpenAlex

Gene regulation is a complex and relatively poorly understood process. While a number of methods have suggested means by which gene transcription is activated, there are factors at work that no model has been able to fully explain. In eukaryotes, gene regulation is quite complex, so models have primarily focused on a relatively simple species, Saccharomyces cerevisiae. Because of the inherent complexity in higher species, and even in yeast, a method of identifying transcription factor (TF) binding motifs must be efficient and thorough in its analysis. Here we propose a method using the very efficient Fast Orthogonal Search (FOS) algorithm in order to uncover motifs as well as cooperatively binding groups of motifs that can explain variations in gene expression. The algorithm is very fast, exploring a motif list and constructing a final model within seconds or a few minutes, produces model terms that are consistent with known motifs while also revealing new motifs and interactions, and causes impressive reduction in variance with relatively few model terms over the cell cycle.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.118
Threshold uncertainty score0.707

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0010.000
Scholarly communication0.0000.000
Open science0.0010.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.042
GPT teacher head0.282
Teacher spread0.240 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it