Fig. 5.

Two steps of the MORA algorithm. In the first step (part a), given the average path length (APL), MORA searches the shortest paths between the two adjacent multi-omics e_j and e_j+1. of length: ψ∈[1, ⌈APL⌉]. The green dotted line indicates paths of length ψ=1 and the magenta dotted lines represents paths of length ψ=1, MORA does not searches a path of length 3 (which would imply ψ=3) because we supposed that the APL = 2. The algorithm then updates the weight vector infl and moves on the next pattern positions where searches for the next adjacent multi-omics (e_j+1 and e_h=j+2). In the second step (part b) MORA evaluates the shortest paths for ψ=1 and 2. The array of the weights infl is updated, as shown in the step i to i+3, according to the algorithm