公开(公告)号：US20170060998A1

公开(公告)日：2017-03-02

申请号：US15349580

申请日：2016-11-11

Applicant: Huawei Technologies Co., Ltd.

Inventor： Chen Liang ,  Wei Fan

IPC: G06F17/30

CPC classification number: G06F16/3344 ,  G06F16/322

Abstract: The present invention provide a method and an apparatus for mining a maximal repeated sequence, where a maximal repeated sequence is determined based on pipelines and a suffix tree, thereby implementing incremental mining and improving computation efficiency. The method comprises: acquiring a character; appending the character to each pipeline in a pipeline set, and separately determining whether a sequence in each pipeline appended with the character is the same as a corresponding sequence on a suffix tree; determining a maximal repeated sequence according to a first preset policy and the sequence in the first pipeline when there exists such a first pipeline in the pipeline set that after the character is appended to the first pipeline, a sequence in the first pipeline is different from a corresponding sequence on the suffix tree.

Abstract translation: 本发明提供一种用于挖掘最大重复序列的方法和装置，其中基于流水线和后缀树确定最大重复序列，从而实现增量挖掘并提高计算效率。 该方法包括：获取字符; 将字符附加到流水线集合中的每个流水线，并单独确定附加有字符的每个流水线中的序列是否与后缀树上的相应序列相同; 当在流水线集合中存在这样的第一流水线时，在字符被附加到第一流水线之后，根据第一预设策略和第一流水线中的序列确定最大重复序列，第一流水线中的序列不同于 后缀树上的相应序列。