MétaCan
Menu
Back to cohort
Record W3099108980 · doi:10.1101/2020.11.12.380600

StrongestPath: a Cytoscape application for protein-protein interaction analysis

2020· preprint· en· W3099108980 on OpenAlexaff
Zaynab Mousavian, Mehran Khodabandeh, Ali Sharifi‐Zarchi, Alireza Nadafian, Alireza Mahmoudi

Bibliographic record

VenuebioRxiv (Cold Spring Harbor Laboratory) · 2020
Typepreprint
Languageen
FieldBiochemistry, Genetics and Molecular Biology
TopicBioinformatics and Genomic Networks
Canadian institutionsSimon Fraser University
FundersInstitute for Research in Fundamental Sciences
KeywordsComputer scienceProtein–protein interactionComputational biologySet (abstract data type)Network analysisGraphical user interfaceInteraction networkBioinformaticsDatabaseGeneBiologyGeneticsEngineeringOperating system

Abstract

fetched live from OpenAlex

ABSTRACT Background StrongestPath is a Cytoscape 3 application that enables to look for one or more cascades of interactions connecting two single or groups of proteins in a collection of protein-protein interaction (PPI) network or signaling network databases. When there are different levels of confidence over the interactions, it is able to process them and identify the cascade of interactions having the highest total confidence score. Given a set of proteins, StrongestPath can extract and show the network of interactions among them from the given databases, and expand the network by adding new proteins having the most interactions with highest total confidence to the current proteins. The application can also identify any activation or inhibition regulatory paths between two distinct sets of transcription factors and target genes. This application can be either used with a set of built-in human and mouse PPI or signaling databases, or any user-provided database for some organism. Results Our results on 12 signaling pathways from the NetPath database demonstrate that the application can be used for indicating proteins which may play significant roles in the middle of the pathway by finding the strongest path(s) in the PPI or signaling network. Conclusion Easy access to multiple public large databases, generating output in a short time, addressing some key challenges in one platform and providing a user-friendly graphical interface make the StrongestPath easy to use.

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.002
metaresearch head score (Gemma)0.004
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Not applicable · Consensus signal: Not applicable
GenreCandidate signal: Software · Consensus signal: Software
Teacher disagreement score0.052
Threshold uncertainty score0.173

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0050.003
Science and technology studies0.0010.001
Scholarly communication0.0020.002
Open science0.0040.003
Research integrity0.0010.003
Insufficient payload (model declined to judge)0.0520.018

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.229
Teacher spread0.217 · 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 designNot applicable
Domainnot available
GenreSoftware

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

Citations1
Published2020
Admission routes1
Has abstractyes

Explore more

Same venuebioRxiv (Cold Spring Harbor Laboratory)Same topicBioinformatics and Genomic NetworksFrench-language works237,207