MétaCan
Menu
Back to cohort
Record W3203344580 · doi:10.1089/cmb.2021.0468

Escape from Parsimony of a Double-Cut-and-Join Genome Evolution Process

2023· article· en· W3203344580 on OpenAlexaff
Mona Meghdari Miardan, Arash Jamshidpey, David Sankoff

Bibliographic record

VenueJournal of Computational Biology · 2023
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenome Rearrangement Algorithms
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsGenomeGenome evolutionJoin (topology)MathematicsTree (set theory)CombinatoricsComputer scienceBiologyEvolutionary biologyAlgorithmGeneticsGene

Abstract

fetched live from OpenAlex

We analyze models of genome evolution based on both restricted and unrestricted double-cut-and-join (DCJ) operations. Not only do our models allow different types of operations generated by DCJs (including reversals, translocations, transpositions, fissions, and fusions) to take different weights during the course of evolution, but they also let these weights fluctuate over time. We compare the number of operations along the evolutionary trajectory with the DCJ distance of the genome from its ancestor at each step, and determine at what point they diverge: the process escapes from parsimony. Adapting the method developed by Berestycki and Durrett, we approximate the number of cycles in the breakpoint graph of a random genome at time t and its ancestral genome by the number of tree components in a random graph (not necessarily an Erdös–Rényi one) constructed from the model of evolution. In both models, the process on a genome of size n is bound to its parsimonious estimate up to t≈n∕2 steps.

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.003
metaresearch head score (Gemma)0.014
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: Empirical · Consensus signal: Empirical
Teacher disagreement score0.004
Threshold uncertainty score0.015

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0030.014
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.002
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.003
Open science0.0020.002
Research integrity0.0020.002
Insufficient payload (model declined to judge)0.0020.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.014
GPT teacher head0.278
Teacher spread0.264 · 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
GenreEmpirical

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

Citations0
Published2023
Admission routes1
Has abstractyes

Explore more

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