An on-line string matching method without gap constraint

Abstract

The invention relates to an on-line string matching method without gap constraint, which relates to the technical field of electric digital data processing. The on-line mode is used for processing thepattern matching problem without gap constraint and without overlap, that is, characters at the same position in the sequence string can be matched at different positions of the pattern string. The method comprises the following steps: reading a pattern string P to establish a plurality of queues; reading a given sequence string S according to a pre-sequence and a post-sequence; determining whether queue i is capable of creating a node; determining whether the occurrence of a non-overlapping condition can be constituted, and when the occurrence of a condition is constituted, outputting on thedisplay until all the characters in the sequence string S are processed. The invention overcomes the defect that it is difficult to effectively control the space cost and the time cost on the basis of ensuring the completeness of the prior art, and not only improves the solving speed, but also ensures the completeness of the solution.

Description

technical field [0001] The technical solution of the present invention relates to the technical field of electrical digital data processing, in particular to an online string matching method without gap constraint. Background technique [0002] With the continuous progress of society and the vigorous development of the computer field, data processing has gradually become a research hotspot, and it is particularly important to retrieve more useful information from the data. Furthermore, researchers characterize the information in the data , and make statistics on it, so the technology of string matching will emerge. With the development of technology, researchers will find out all the substrings in a certain string that are the same as a given substring. Defined as string matching or pattern matching, string matching or pattern matching has a wide range of practical applications, not only for simple biological sequence matching, but also for shopping psychological matching in...

AI Technical Summary

Problems solved by technology

[0013] Two conditions are very important in pattern matching: one is to meet the completeness requirements of the solution; the other is to improve the speed of solution and reduce the space overhead. Satisfy these two conditions at the same time, for example: the online method proposed in the literature "an efficient on-line algorithm for approximate pattern matching with wildcards and Length constraints, IEEE." published by Wu Xindong and Zhu Xinquan, although get rid of the traditional offline technology, use the online The method of reading characters saves a lot of time, but because it is aimed at one-time conditions, it cannot solve the problem of frequent patterns well; the literature published by Huang Guolin, Guo Dan, and Hu Xuegang "Approximate patterns based on wildcards and length constraints Matching method, computer application." Proposed an approximate pattern matching method based on EDM, which can handle three editing operations in approximate matching, namely insertion, replacement and deletion operations, but in the process of solving approximate matching, the incomplete matching of characters , so that it can only be a loose match; Wu Youxi and Shen Cong published the document "Strict pattern matching under non-overlapping condition, Science China Information Sciences." A pattern matching method under the network tree structure is proposed, and each character is represented by a node The form is stored in the tree structure, and the nodes that meet the conditions are established as a parent-child relationship, which solves the completeness of the solution under the condition of no overlap, and it has a lot of advantages compared with other methods under various constraints. Good performance, but when dealing with non-overlapping problems with no gap constraints, the space overhead of this method increases rapidly, resulting in a sharp drop in solution speed; the literature published by Wu Youxi and Tong Yao "NOSEP: Nonoverlapping Sequence Pattern Mining with GapConstraints. IEEE Transactions on Cybernetics." The content reported in it is to use non-overlapping constraints for sequential pattern mining, which belongs to the application of string matching. This document needs to pre-set the gap constraints, and then carry out sequential pattern mining

[0014] In short, to solve the problem of non-overlapping pattern matching without gap constraints, it is difficult to effectively control the problem of space overhead and time overhead on the basis of ensuring completeness in the existing technology, and there is no good method to solve this problem so far. class questions

Images