Fig. 7
From: \(\textsc {McDag}\): indexing maximal common subsequences for k strings

Number of nodes and edges in \(\texttt{random}\) for increasing alphabet size \(|\Sigma |\), vs \(n^2 = 9\cdot 10^6\)
From: \(\textsc {McDag}\): indexing maximal common subsequences for k strings
Number of nodes and edges in \(\texttt{random}\) for increasing alphabet size \(|\Sigma |\), vs \(n^2 = 9\cdot 10^6\)