Fig. 11
From: \(\textsc {McDag}\): indexing maximal common subsequences for k strings
Number of nodes in \(\mathtt {hiv{-}1}\) for \(k=2\) sequences and \(k=3\) sequences
Fig. 11 | Algorithms for Molecular Biology
From: \(\textsc {McDag}\): indexing maximal common subsequences for k strings
Number of nodes in \(\mathtt {hiv{-}1}\) for \(k=2\) sequences and \(k=3\) sequences
Algorithms for Molecular Biology