Fig. 4
From: \(\textsc {McDag}\): indexing maximal common subsequences for k strings
The resulting index \(\textsc {McDag}\) over two input strings \(\mathcal {Z}_1=\) ATXGTCXC and \(\mathcal {Z}_2=\) TTAXCG. Even though it can be proven that this is the minimal deterministic MCS index, we need more nodes with label X than the possible matches of that character