MétaCan
Menu
Back to cohort
Record W2149260201 · doi:10.1093/bioinformatics/bts511

Optimal timepoint sampling in high-throughput gene expression experiments

2012· article· en· W2149260201 on OpenAlexafffund
Bruce A. Rosa, Ji Zhang, Ian T. Major, Wensheng Qin, Jin Chen

Bibliographic record

VenueBioinformatics · 2012
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGene expression and cancer classification
Canadian institutionsLakehead University
FundersNatural Sciences and Engineering Research Council of CanadaU.S. Department of Energy
KeywordsSampling (signal processing)Computer scienceThroughputSelection (genetic algorithm)Data miningFalse discovery rateExpression (computer science)Machine learningComputational biologyGeneBiologyGenetics

Abstract

fetched live from OpenAlex

MOTIVATION: Determining the best sampling rates (which maximize information yield and minimize cost) for time-series high-throughput gene expression experiments is a challenging optimization problem. Although existing approaches provide insight into the design of optimal sampling rates, our ability to utilize existing differential gene expression data to discover optimal timepoints is compelling. RESULTS: We present a new data-integrative model, Optimal Timepoint Selection (OTS), to address the sampling rate problem. Three experiments were run on two different datasets in order to test the performance of OTS, including iterative-online and a top-up sampling approaches. In all of the experiments, OTS outperformed the best existing timepoint selection approaches, suggesting that it can optimize the distribution of a limited number of timepoints, potentially leading to better biological insights about the resulting gene expression patterns. AVAILABILITY: OTS is available at www.msu.edu/∼jinchen/OTS.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.010
metaresearch head score (Gemma)0.024
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.010
Threshold uncertainty score0.052

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0100.024
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.001
Bibliometrics0.0010.002
Science and technology studies0.0010.002
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0010.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.033
GPT teacher head0.299
Teacher spread0.266 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations13
Published2012
Admission routes2
Has abstractyes

Explore more

Same venueBioinformaticsSame topicGene expression and cancer classificationFrench-language works237,207