Find Drugs

Find Drug Targets

You can only run {{ maxTasks }} tasks at once. Please wait for one of them to finish or delete it from the task list.
{{ algo.name }}
About TrustRank

TrustRank is a node centrality measure that ranks nodes in a network based on how well they are connected to a (trusted) set of seed nodes.

Check the documentation for more info

Specifies whether also drugs targeting interactors of the seed nodes should be considered.

The larger the damping factor, the faster the trust is propagated through the network.

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Penalty parameter for hubs.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.

About Closeness Centrality

Closeness Centrality is a node centrality measure that ranks the nodes in a network based on the lengths of their shortest paths to all other nodes in the network.

Specifies whether also drugs targeting interactors of the seed nodes should be considered.

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Penalty parameter for hubs.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.

About Degree Centrality

Degree Centrality assigns an importance score based simply on the number of links held by each node. In Drugst.One, we use a modified version which does not consider all links but only the neighbouring seeds.

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.

About Network Proximity

Network Proximity uses the average minimum distance from the drug’s targets to all of the selected seeds as a measure of proximity.

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Penalty parameter for hubs.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.

About Betweenness Centrality

Betweenness Centrality ranks the proteins in a network based on how many shortest paths pass through them.

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Penalty parameter for hubs.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.

About KeyPathwayMiner

KeyPathwayMiner is a network enrichment tool that identifies condition-specific sub-networks (key pathways) (Alcaraz et al. 2016).

Number of new proteins to be found.

About Multi-level Steiner Tree

The Multi-level Steiner Tree algorithm can be used to approximate a minimum spanning subnetwork between seed nodes, which happen to be central interaction partners between the seed nodes, and thus represent favorable drug-targets (Ahmed et al. 2019).

All nodes with degree greater than this value will be ignored. Disabled if equal to 0.

Penalty parameter for hubs.

Include PPI edges from displayed network in the algorithms or use only edges from the Drugst.One database.