Abstract: The Multiple Longest Common Subsequence (MLCS) Problem is to find one or more longest common subsequences from multiple (≥ 3) strings. However, as the scale of the sequences increases, the ...
Abstract: In the group decision-making process, experts and decision makers can sometimes provide subjective evaluation information with classification labels. To effectively deal with it and make a ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results