Find Drugs

Find Drug Targets

You have selected viral proteins. When finding drugs, make sure you have selected host proteins only.
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}}

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 times number of vertices will be ignored.

Penalty parameter for hubs.

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 (Gyöngyi, Garcia-Molina, and Pedersen 2004).

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

All nodes with degree greater than this value times number of vertices will be ignored.

Penalty parameter for hubs.

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 (Kaczprowski, Doncheva, and Albrecht 2013).

All nodes with degree greater than this value times number of vertices will be ignored.

About Degree Centrality

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

You have selected viral proteins. If you want to use KeyPathwayMiner, please remove them because it cannot process them.
About KeyPathwayMiner

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

All nodes with degree greater than this value times number of vertices will be ignored.

Penalty parameter for hubs.

About Multi-Steiner

The Steiner tree problem is a classical combinatorial optimization problem. It asks to find a sub-graph of minimum size connecting a given set of seed nodes. This implementation behaves non-deterministically, so results can differ between multiple runs.