Abstract: The multiple longest common subsequence (MLCS) problem, related to the identification of sequence similarity, is an important problem in many fields. As an NP-hard problem, its exact ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results