“…However, computational tools to study graph data structures in biological graphs can suffer from high computational and space costs, especially in large-scale information containing graphs [ 28 ]. Graph embedding algorithms can then be used to identify interactions between heterogeneous nodes such as: drug–target [ 26 , 99 – 101 ], miRNA-disease [ 30 , 31 ], miRNA-target [ 32 ], miRNA-gene [ 32 ], microbe-drug [ 102 ], gene–disease [ 31 , 103 ], gene–pathway [ 31 ], cell–gene [ 104 ], chemical–disease [ 31 ]. On the other hand, the interaction between homogeneous nodes may be protein–protein [ 26 – 29 ], drug–drug [ 34 , 100 , 102 ], microbe-microbe [ 102 ], gene–gene [ 104 ].…”