Fig. 2From: A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problemsThe DAG is constructed for three sequences, \(s_1 = \texttt {AACGTCGT}\), \(s_2 = \texttt {CGACGTCC}\) and \(s_3 = \texttt {GACCGTCT}\), with black and gray nodes representing repeated and dominated nodes, respectivelyBack to article page