MétaCan
Menu
Back to cohort
Record W1985086849 · doi:10.1109/tnb.2012.2210907

Identification of Hierarchical and Overlapping Functional Modules in PPI Networks

2012· article· en· W1985086849 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

VenueIEEE Transactions on NanoBioscience · 2012
Typearticle
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicBioinformatics and Genomic Networks
Canadian institutionsUniversity of Saskatchewan
Fundersnot available
KeywordsIdentification (biology)Computer scienceComputational biologyBiology

Abstract

fetched live from OpenAlex

Various evidences have demonstrated that functional modules are overlapping and hierarchically organized in protein-protein interaction (PPI) networks. Up to now, few methods are able to identify both overlapping and hierarchical functional modules in PPI networks. In this paper, a new hierarchical clustering algorithm, called OH-PIN, is proposed based on the overlapping M_clusters, λ-module, and a new concept of clustering coefficient between two clusters. By recursively merging two clusters with the maximum clustering coefficient, OH-PIN finally assembles all M_clusters into λ -modules. Since M_clusters are overlapping, λ -modules based on them are also overlapping. Thus, OH-PIN can detect a hierarchical organization of overlapping modules by tuning the value of λ. The hierarchical organization is similar to the hierarchical organization of GO annotations and that of the known complexes in MIPS. To compare the performance of OH-PIN and other existing competing algorithms, we apply them to the yeast PPI network. The experimental results show that OH-PIN outperforms the existing algorithms in terms of the functional enrichment and matching with known protein complexes.

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: none
Teacher disagreement score0.517
Threshold uncertainty score0.282

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.010
GPT teacher head0.222
Teacher spread0.212 · 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