Find Drugs
Find Drug Targets
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).
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).
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.
KeyPathwayMiner is a network enrichment tool that identifies condition-specific sub-networks (key pathways) (Alcaraz et al. 2016).
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.