MétaCan
Menu
Back to cohort
Record W2094969206 · doi:10.1109/tcbb.2004.43

Maximum-scoring segment sets

2004· article· en· W2094969206 on OpenAlexaff

Bibliographic record

VenueIEEE/ACM Transactions on Computational Biology and Bioinformatics · 2004
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicRNA and protein synthesis mechanisms
Canadian institutionsUniversité de Montréal
Fundersnot available
KeywordsDisjoint setsIdentification (biology)SegmentationSequence (biology)Simple (philosophy)Computer scienceStatement (logic)Multiple sequence alignmentPattern recognition (psychology)CombinatoricsMathematicsComputational biologyArtificial intelligenceGeneGeneticsSequence alignmentBiologyPeptide sequence

Abstract

fetched live from OpenAlex

We examine the problem of finding maximum-scoring sets of disjoint segments in a sequence of scores. The problem arises in DNA and protein segmentation and in postprocessing of sequence alignments. Our key result states a simple recursive relationship between maximum-scoring segment sets. The statement leads to fast algorithms for finding such segment sets. We apply our methods to the identification of noncoding RNA genes in thermophiles.

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.004
metaresearch head score (Gemma)0.022
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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.010
Threshold uncertainty score0.033

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.022
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0050.005
Science and technology studies0.0020.003
Scholarly communication0.0030.007
Open science0.0030.004
Research integrity0.0030.002
Insufficient payload (model declined to judge)0.0100.003

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.016
GPT teacher head0.264
Teacher spread0.248 · 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

Citations30
Published2004
Admission routes1
Has abstractyes

Explore more

Same venueIEEE/ACM Transactions on Computational Biology and BioinformaticsSame topicRNA and protein synthesis mechanismsFrench-language works237,207