MétaCan
Menu
Back to cohort
Record W4403793040 · doi:10.1101/2024.10.25.620288

Preprocessing homologous regions in annotated protein sequences concerning machine-learning applications

2024· preprint· en· W4403793040 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

VenuebioRxiv (Cold Spring Harbor Laboratory) · 2024
Typepreprint
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicMachine Learning in Bioinformatics
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsHomologous chromosomeComputer scienceProtein superfamilyArtificial intelligenceComputational biologyBiologyGeneticsGene

Abstract

fetched live from OpenAlex

Abstract Accurate preprocessing of annotated protein sequences with regard to homologies is essential for maintaining the integrity of machine-learning applications. This study presents two new tools—HAM (Homology-based Annotation Masking) and HAC (Homology Annotation Conflict)— designed to address these challenges. HAM detects and masks homologous regions between datasets to prevent leakage, while HAC identifies and resolves annotation inconsistencies within datasets. Applying these tools to three benchmark datasets revealed substantial overlooked homology and annotation conflicts, even in datasets that had been previously clustered by sequence identity. These findings underscore the importance of homology-aware preprocessing to ensure the integrity of model training and evaluation. By integrating HAM and HAC into machine learning workflows, researchers can improve the consistency and trustworthiness of protein sequence-based predictions. Availability github.com/NawarMalhis/HAM.git

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 categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Bench or experimental · Consensus signal: Bench or experimental
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.177
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0010.002
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.011
GPT teacher head0.241
Teacher spread0.231 · 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