MétaCan
Menu
Back to cohort
Record W2022846158 · doi:10.1089/10665270360688129

Tests for Gene Clustering

2003· article· en· W2022846158 on OpenAlexaff
Dannie Durand, David Sankoff

Bibliographic record

VenueJournal of Computational Biology · 2003
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenome Rearrangement Algorithms
Canadian institutionsUniversity of Ottawa
FundersNational Human Genome Research Institute
KeywordsGenomeBiologyGeneGene duplicationComparative genomicsHorizontal gene transferGene clusterGeneticsGenomicsEvolutionary biologyGene familyComputational biologyGenome evolution

Abstract

fetched live from OpenAlex

Comparing chromosomal gene order in two or more related species is an important approach to studying the forces that guide genome organization and evolution. Linked clusters of similar genes found in related genomes are often used to support arguments of evolutionary relatedness or functional selection. However, as the gene order and the gene complement of sister genomes diverge progressively due to large scale rearrangements, horizontal gene transfer, gene duplication and gene loss, it becomes increasingly difficult to determine whether observed similarities in local genomic structure are indeed remnants of common ancestral gene order, or are merely coincidences. A rigorous comparative genomics requires principled methods for distinguishing chance commonalities, within or between genomes, from genuine historical or functional relationships. In this paper, we construct tests for significant groupings against null hypotheses of random gene order, taking incomplete clusters, multiple genomes, and gene families into account. We consider both the significance of individual clusters of prespecified genes and the overall degree of clustering in whole genomes.

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.034
metaresearch head score (Gemma)0.246
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.034
Threshold uncertainty score0.179

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0340.246
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.004
Bibliometrics0.0070.007
Science and technology studies0.0030.009
Scholarly communication0.0040.005
Open science0.0060.004
Research integrity0.0050.004
Insufficient payload (model declined to judge)0.0070.001

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.020
GPT teacher head0.298
Teacher spread0.278 · 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 designTheoretical or conceptual
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

Citations77
Published2003
Admission routes1
Has abstractyes

Explore more

Same venueJournal of Computational BiologySame topicGenome Rearrangement AlgorithmsFrench-language works237,207