MétaCan
Menu
Back to cohort
Record W2098402986 · doi:10.1142/s0129054105003091

FORMAL MODELLING OF VIRAL GENE COMPRESSION

2005· article· en· W2098402986 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

VenueInternational Journal of Foundations of Computer Science · 2005
Typearticle
Languageen
FieldComputer Science
TopicAlgorithms and Data Compression
Canadian institutionsUniversity of SaskatchewanWestern University
Fundersnot available
KeywordsGenomesortGeneComputer scienceComputational biologyFormal languageHuman genomeBiologyTheoretical computer scienceArtificial intelligenceGeneticsProgramming languageInformation retrieval

Abstract

fetched live from OpenAlex

The study of viruses in molecular genetics, as biological entities with extremely small genomes, and in medicine, as pathogens, represents an important area of inquiry with significant potential for improving scientific knowledge in both domains. One of the most fascinating genetic adaptations of viruses is the ability to compress their own genomes. We exposit here a formal model of gene compression in viruses and study its properties from a formal-language-theoretic standpoint. In addition to enumerating abstract properties of gene compression for infinite languages, we pay particular attention to the case of finite languages and algorithms for identifying, classifying and quantifying gene compression in real viruses. Information of this sort has applications to automated classification of new viruses and the prediction of potential proto-oncogenes in the human genome.

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.001
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: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.457
Threshold uncertainty score0.629

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.000
Science and technology studies0.0000.000
Scholarly communication0.0000.005
Open science0.0030.001
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.028
GPT teacher head0.297
Teacher spread0.269 · 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