Fig. 5From: A study on multi-omic oscillations in Escherichia coli metabolic networksTwo 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 ej and ej+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 (ej+1 and eh=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 algorithmBack to article page