MétaCan
Menu
Back to cohort
Record W1992306462 · doi:10.1089/cmb.2008.21tt

How to Synchronize Biological Clocks

2009· article· en· W1992306462 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.

fundA Canadian funder is recorded on the work.
no affNo Canadian affiliation: this work is invisible to an affiliation-only frame.
No Canadian affiliation. An affiliation-only frame, the usual design, would never have seen this work. It is one of the works that make the case for inverting the frame.

Bibliographic record

VenueJournal of Computational Biology · 2009
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene Regulatory Network Analysis
Canadian institutionsnot available
FundersInstitute of GeneticsEuropean Commission
KeywordsBiological clockConstruct (python library)Computer scienceBiological networkSynchronization (alternating current)Set (abstract data type)Distributed computingTheoretical computer scienceComputer networkBiologyComputational biologyProgramming languageNeuroscience

Abstract

fetched live from OpenAlex

This paper is concerned with a novel algorithm to study networks of biological clocks. A new set of conditions is established that can be used to verify whether an existing network synchronizes or to give guidelines to construct a new synthetic network of biological oscillators that synchronize. The methodology uses the so-called contraction theory from dynamical system theory and Gershgorin disk theorem. The strategy is validated on two examples: a model of glycolisis in yeast cells and a synthetic network of Repressilators that synchronizes.

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.000
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: Bench or experimental · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.629
Threshold uncertainty score0.374

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.011
GPT teacher head0.262
Teacher spread0.251 · 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