figshare
Browse
pcbi.1008464.g003.tif (264.38 kB)

Average time required to calculate the effect of simple paths for all drug-disease pairs used in the validation on two heterogeneous networks using different lmax.

Download (264.38 kB)
figure
posted on 2020-12-02, 18:46 authored by Daniel Rivas-Barragan, Sarah Mubeen, Francesc Guim Bernat, Martin Hofmann-Apitius, Daniel Domingo-Fernández

The analysis was also conducted to take paths with repetitions of vertices between drug-disease pairs into account using the all_paths variant of drug2ways, but not for the NetworkX and NetworKit libraries which lack equivalent implementations. Nevertheless, the implementations of both libraries could be easily adapted to return paths with repetitions of vertices. However, without the proper optimizations described in the Subsection Theoretical background, these would have a higher complexity than their all_simple_paths counterpart as nodes would be revisited. Therefore, for both libraries we use simple paths as the baseline for the analysis.

History