Table 2.

Steps involved in the construction of partial STG ($S^q$) at the $q^{\mathit{th}}$ permutation.

Steps involved in constructing $S^q$
a) Choose a state ${\stackrel{\circledR }{\mathit{v}}}_i\in \mathbb{R}$.
b) Choose a permutation from $q_{\max }=N!$.
c) Starting from ${\stackrel{\circledR }{\mathit{v}}}_i$, for the chosen permutation, identify the state ${\stackrel{\circledR }{\mathit{v}}}_e$ reached after one BD simulation with ROA (Methods).
d) Update $S^q$ with the one-step transitions between states ${\stackrel{\circledR }{\mathit{v}}}_i$ and ${\stackrel{\circledR }{\mathit{v}}}_e$.
e) Repeat steps (b) to (d) for the remaining q-1 times while ensuring no redundancy in the permutation chosen in step (b) for a specific state ${\stackrel{\circledR }{\mathit{v}}}_i$
f) Repeat steps (b) to (e) for all $\stackrel{\circledR }{\mathit{v}}\in \mathbb{R}$.