Incomplete Interactome
Uncovering disease-disease relationships through the incomplete interactome
Jörg Menche, Amitabh Sharma, Maksim Kitsak, Susan Dina Ghiassian, Marc Vidal, Joseph Loscalzo and Albert-László Barabási · Science 347(6224), 1257601 (2015)
Use unweighted shortest paths to study node proximity in interaction networks.
What you will implement
Implement single-source distances, pairwise shortest-path lengths and explicit shortest paths; this does not reproduce the paper's disease-module separation measure or real disease-association analysis.
- 117. Shortest Paths and Network Proximity
Compute shortest-path lengths and concrete paths in an unweighted interaction network, handle unreachable targets and tied paths, and read path length as a proximity hypothesis rather than proof of function.
Single-source distances, pairwise distance and the lexicographically smallest shortest path on an unweighted undirected graph; weighted paths and the paper's module-separation measure are not implemented.