MétaCan
Menu
Back to cohort
Record W1987659734 · doi:10.1145/2506583.2512372

Prediction of Biological Protein-protein Interaction Types Using Short-Linear Motifs

2013· article· en· W1987659734 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
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicMachine Learning in Bioinformatics
Canadian institutionsUniversity of Windsor
Fundersnot available
KeywordsSupport vector machineComputer scienceIdentification (biology)Protein–protein interactionCurse of dimensionalityObligateDimensionality reductionArtificial intelligenceMachine learningPattern recognition (psychology)Computational biologyData miningBiologyGenetics

Abstract

fetched live from OpenAlex

Protein-protein interactions (PPIs) play a key role in many biological processes and functions in living cells. Thus, identification, prediction, and analysis of PPIs are important aspects in molecular biology. We propose a computational model to predict biological PPI types using short-linear motifs (SLiMs). The information contained in protein sequences is used to distinguish between interaction types, namely obligate and non-obligate. Classifiers, such as k-nearest neighbor (k-NN), support vector machine (SVM) and linear dimensionality reduction (LDR) on two well-known datasets confirm the power of the proposed model with accuracy above 99%. The results show that the information contained in the training sequences is crucial for prediction and analysis of biological PPIs.

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 categoriesnone
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.104
Threshold uncertainty score0.311

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.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.037
GPT teacher head0.283
Teacher spread0.247 · 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

Citations2
Published2013
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning in BioinformaticsFrench-language works237,207