Exact and Heuristic Methods for Network Completion for Time-Varying Genetic Networks

Figure 3

Schematic illustrations for definition of the top 𝑀 combinations. This is an example for the cases of 𝑀=3 and 𝑘≤3. Let 𝑆^𝑘_𝑖 denote the set of 𝑀 combinations computed at the 𝑘th step. At the 𝑘th step, for each combination {𝑣_𝑖1,…,𝑣_𝑖𝑘−1}∈𝑆¹_𝑖∪𝑆²_𝑖∪⋯∪𝑆_𝑖^𝑘−1, we calculate the least squares error for each 𝑣_𝑗 such that 𝑗>𝑖_𝑘−1 as a 𝑘th incoming node to 𝑣_𝑖.