MétaCan
Menu
Back to cohort
Record W4394741953 · doi:10.1002/9781394284252.ch5

A Century of Genomic Rearrangements

2024· other· en· W4394741953 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

Venuenot available
Typeother
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicGenome Rearrangement Algorithms
Canadian institutionsUniversité du Québec à Montréal
Fundersnot available
KeywordsCitationAnnotationGenomeGenealogyBiologyPhilosophyArt historyGeneticsComputer scienceArtGeneHistoryLibrary science

Abstract

fetched live from OpenAlex

This chapter develops the mathematical and algorithmic techniques utilized to address gene rearrangement problems, both in their original sense as markers of inherited traits, and in their modern interpretation as families of transcripts. This chapter focuses on the rearrangement problem between representative genomes of different species. Modern genome sequencing and annotation techniques identify the position and orientation of genes on the chromosomes. The chapter addresses the problem of enumerating the set of all optimal scenarios that transform one genome into another. The basic principle can be described in terms of balanced cycles. The chapter computes the sequences of double-cut-and-join (DCJ) operations of minimum length. One way to build balanced cycles uses the dashed edges to balance an unbalanced cycle. These dashed edges make it possible to model the fact that a DCJ operation can change the number of chromosomes, and as such, the number of telomeres in a genome, while maintaining the same gene content.

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 categoriesInsufficient payload (model declined to judge)
Consensus categoriesInsufficient payload (model declined to judge)
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Other · Consensus signal: Other
Teacher disagreement score0.116
Threshold uncertainty score1.000

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.0030.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.007
GPT teacher head0.236
Teacher spread0.229 · 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

Quick stats

Citations0
Published2024
Admission routes1
Has abstractyes

Explore more

Same topicGenome Rearrangement AlgorithmsFrench-language works237,207