Abstract: In many data-sparse applications, acquiring sufficient data for clustering can be challenging. To address the clustering of sparse subsequences within a target domain, this paper proposes a ...

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 ...