Abstract: The multiple longest common subsequence (MLCS) problem ... In this paper, we present a new progressive algorithm, Pro-MLCS, based on the dominant point approach. Pro-MLCS can find an ...