According to the problem that existing algorithms are apt to be interfered by noise, a motif mining algorithm based on the Longest Common Subsequence(LCSS) distance is introduced.

• 针对现有主旨模式挖掘算法易受噪声干扰的问题,提出一种基于最长公共子序列距离的挖掘算法。