Fig. 1From: A fast and efficient path elimination algorithm for large-scale multiple common longest sequence problemsshows the L score table for two sequences, \(s_1 = \texttt {AACGTCGT}\) and \(s_2 = \texttt {CGACGTCC}\). The LCS can be determined by traveling from number 5 to number 1 in the scoring table L. And the dominates region may be represented by a shaded portionBack to article page