摘要:带有间隙约束的模式匹配问题是序列模式挖掘的关键问题之一.目前，大多数的研究都为非负间隙，对字符串中每个字符的出现顺序有着严格的要求.为了增加匹配的灵活性，并且考虑到在序列模式挖掘中采用one-off条件更加合理，研究一般间隙与one-off条件下的模式匹配问题.该问题为NP-Hard问题.为了有效地求解该问题，提出了MSAING（maximum sequential pattern matching with one-off and general gaps condition）算法：首先，利用Reverse策略使模式与序列达到最佳的匹配状态；然后，使用线性表的结构使匹配过程中消耗的时间和空间大幅度地降低，同时，利用回溯机制提高匹配的成功率；最后，根据inside_Checking机制判断模式串是否会产生内部重复现象，以进一步提高算法的执行效率.理论证明了MSAING算法的完备性，实验结果验证了MSAING算法匹配结果的准确性以及在时间和空间方面的高效性.



Abstract:Pattern matching with gap constraints is one of the key issues of sequential pattern mining. Recently, most research work focuses on pattern matching with non-negative gaps, but the rule strictly limits the order that each character appears in the sequence. In order to increase the flexibility of matching while taking into account that it is more reasonable to use one-off condition in sequential pattern mining, this paper studies the pattern matching problem under general gap and one-off condition, which is NP-hard. To tackle this issue, an algorithm, named MSAING, is proposed. Firstly, the algorithm processes the pattern and sequence using the Reverse strategy to get the maximum number of matching results. Secondly, it significantly reduces the time and space overhead with linear table structure in the matching process, and improves the matching rate using the backtracking method. Finally, to further improve the efficiency of the algorithm, it determines whether internal repetition exists in the pattern or not, according to the inside_Checking mechanism. Completeness of the MSAING algorithm is proved in theory. Experimental results verify the accuracy of the matching results of the MSAING algorithm and its validity in terms of the time and space complexity.



PDF全文下载地址:

http://jos.org.cn/jos/article/pdf/5255