CN108920483A - Character string fast matching method based on Suffix array clustering - Google Patents
Character string fast matching method based on Suffix array clustering Download PDFInfo
- Publication number
- CN108920483A CN108920483A CN201810398497.5A CN201810398497A CN108920483A CN 108920483 A CN108920483 A CN 108920483A CN 201810398497 A CN201810398497 A CN 201810398497A CN 108920483 A CN108920483 A CN 108920483A
- Authority
- CN
- China
- Prior art keywords
- string
- character
- suffix
- text
- less
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention provides a kind of character string fast matching method based on Suffix array clustering.This method includes two stages, and it is in the Suffix array clustering section that may be present of bebinning character that appearance position of the pattern string in text string is limited to the initial character gone here and there in mode first with binary chop by first stage；Second stage further limits search criterion on this section again, exclude the length suffix different from pattern string ultimate character less than pattern string and ultimate character, to reduce the number of comparisons of character while reduce the range of string matching, and then it is quickly obtained appearance position of the pattern string in text string.
Description
Technical field
The present invention relates to the natural language processing technique fields under field of computer technology.More particularly to when in a kind of text
Between information processing method.
Background technique
String matching is called pattern match, is to be widely used in information retrieval, intrusion detection, calculation biology, search
The a key technology in the fields such as engine, data compression.So-called pattern matching problem refers to searching some AD HOC string P
=p1p2…pmIn text string T=t1t2…tnIn all appearance positions and appearance number.According to research field and research pair
The difference of elephant, pattern matching problem, which can be divided into, is roughly divided into following four：Precise character String matching, escape character (ESC) String matching,
Regular expression matching and approximate character string matching.Suffix array clustering is an orderly integer array, is in string processing
Powerful, and realized with it is simple, the advantages that space hold amount is small and it is more more practical than suffix tree.
The character string T=t that a given length is n1t2…tn, text is denoted as T [i]=t on the i of positioni, suffix refer to from
Some position i starts a special substring to entire string ending, as T [i, n]=titi+1…tn, it is also indicated as Suffix
(i).Suffix array clustering SA is an one-dimensional integer array, saves some that 1 arrives n and arranges SA [1], SA [2] ... SA [n], and
Guarantee Suffix (SA [i])<Suffix (SA [i+1]), wherein i<n.For traditional character string matching method, it is based on
The method for mode matching of Suffix array clustering is another thinking for solving string matching problem.The existing word based on Suffix array clustering
String matching method is accorded with, generally determines appearance position of the pattern string in text string by carrying out binary search twice to Suffix array clustering
It sets.During by substring carries out matched in pattern string and text string, existing method directly matches entire pattern string,
Identical for prefix in character string in this way and suffix is different, suffix is identical and in the case of prefix is different for, will cause a large amount of nothings
The charactor comparison of effect, increases match time.
It is disclosed in Chinese invention patent specification CN 2201410725893.6 in a kind of text sequence data quickly
The method for searching feature string is decomposed when searching in Suffix array clustering in search procedure by binary chop, according to
The line number of suffix matrix, every row are searched, if after certain field predetermined number of times occurs in the result set of binary chop,
By calculating the similarity of two fields, immediate field is taken as a candidate field.But after the invention does not utilize
Sew the feature of array text to reduce the string matching time.
A kind of fuzzy string based on Suffix array clustering is disclosed in Chinese invention patent specification CN 201410368238.X
Join repetitive sequence recognition methods, a kind of short message searching method based on Suffix array clustering is disclosed in CN 201710224648.0
And system, it is all dissimilar with the purpose of the present invention and method.
Summary of the invention
The technical problem to be solved by the present invention is to the existing character string matching method search efficiencies based on suffix number
Not high problem proposes a kind of character string fast matching method based on Suffix array clustering, that is, is quickly found out mode P in text T
The number of appearance.
To achieve the above object, the present invention provides a kind of character string fast matching method based on Suffix array clustering, the party
Method includes the following steps:
1) the Suffix array clustering SA about text string T is established, binary chop then is carried out by pattern string P to Suffix array clustering SA again
The appearance position in text string T be limited in mode go here and there P initial character be bebinning character Suffix array clustering section in [sp,
Ep], wherein sp indicates the possible initial position of suffix identical with pattern string P initial character in text string T, and ep indicates text string
The position that the possibility of suffix identical with pattern string P initial character terminates in T；
2) length is excluded on the obtained section of step 1) be less than pattern string P and ultimate character and pattern string P last bit
The different suffix of character, and then obtain appearance position of the pattern string P in text string T.
Further, the step 1) includes the following steps：
101) the mode text P that input length is m, length are the text T, Suffix array clustering SA of n；
102) initialize temporary variable sp=1, st=n+1, wherein sp indicate text string T in pattern string P initial character phase
The possible initial position of same suffix；
103) 106) if sp is thened follow the steps not less than st；
104) it is positioned by half, temporary variable s=(sp+st)/2；
105) whether the first character of judgment model P is less than SA [s] a character in T, if it is less than then sp=s+1,
Otherwise st=s；Then step 103) is executed；
106) initialize temporary variable ep=sp-1, et=n, wherein ep indicate text string T in pattern string P initial character phase
The position that the possibility of same suffix terminates；
107) 110) if ep is thened follow the steps not less than et；
108) it is positioned by half, temporary variable e=(ep+et)/2；
109) whether the first character of judgment model P is less than SA [e] a character in T, no if it is less than then ep=e
Then 1 et=e-then executes step 107)；
110) [sp, ep] is exported.
Further, the step 2) includes the following steps:
201) the mode text P that input length is m, length are the text T of n, the sp that Suffix array clustering SA and step 1) obtain
And ep；
202) temporary variable i=sp, counter occ=0 are initialized；
203) 209) if i is thened follow the steps not less than ep；
204) judge whether i relevant string length in current location is less than pattern string P or ultimate character and pattern string
Ultimate character whether Tong suffix, i.e., whether meet n-SA [i]<M or T [SA [i]+m] ≠ P [m] executes step if meeting
It is rapid 208)；
205) judge whether i relevant character string in current location equal with mode P, that is, judge P whether with T [SA [i], SA
[i]+m] it is equal, if 207) equal then follow the steps；
206) judge whether i relevant character string in current location is greater than mode P, that is, judge whether P is less than T [SA [i], SA
[i]+m], if meeting condition, 210) condition of satisfaction is thened follow the steps, no to then follow the steps 208)；
207) matching is found, match counter occ adds 1；
208) interim cyclic variable i adds 1, then executes step 203)；
209) number of matches occ is exported.
Beneficial effects of the present invention：Appearance position of the pattern string P in text string T is limited in mode by the present invention first
The initial character of string is that search criterion is then further limited on this section in the Suffix array clustering section of bebinning character, is excluded
The length suffix different from pattern string ultimate character less than pattern string and ultimate character, it is possible to reduce the number of comparisons of character is same
When reduce the range of string matching, and then be quickly obtained appearance position of the pattern string in text string.Of the invention
Excellent with existing method with speed, the time complexity of approximate match search of the present invention is O (logn), exact match search when
Between complexity be O (m*occ), wherein occ refers to frequency of occurrence of the P in T, thus total time complexity of the invention be O
(m*occ+logn)。
Detailed description of the invention
Fig. 1 is the flow chart of character string fast matching method of the embodiment of the present invention based on Suffix array clustering；
Fig. 2 is the approximate adaptation method process of character string fast matching method of the embodiment of the present invention based on Suffix array clustering
Figure；
Fig. 3 is the fine matching method process of character string fast matching method of the embodiment of the present invention based on Suffix array clustering
Figure.
Specific embodiment
In order to make the objectives, technical solutions, and advantages of the present invention clearer, below in conjunction in inventive embodiments
Attached drawing, the technical solution in inventive embodiments is clearly and completely described, it is clear that the embodiments described below are only
It is only invention a part of the embodiment, and not all embodiment.Based on the embodiment in invention, those of ordinary skill in the art exist
All other embodiment obtained under the premise of creative work is not made, the range of invention protection is belonged to.
Fig. 1 is the flow chart of the character string fast matching method the present invention is based on Suffix array clustering.
The number occurred in text T object of the present invention is to be quickly found out mode P, first using the prior art establish about
Then the Suffix array clustering SA of text T searches the number that P occurs in Suffix array clustering SA, that is, completes search.As shown in Figure 1, this hair
Bright embodiment is divided into two steps, and 101 steps are proximity search, and 102 steps are accurate matching.
In order to be matched, the Suffix array clustering SA about text T is established using the prior art first in a step 101, then
Binary search is carried out to Suffix array clustering and acquires pattern string P appearance position range in text string T.Then it utilizes in a step 102
A large amount of prefixes are identical in text and suffix is different or suffix is identical and rule that prefix is different, reinforce matching condition, filter out text
The character of first and last character and pattern string first and last character Incomplete matching in this string, after being less than mode string length simultaneously for length
Sew and is also excluded to carry out Rapid matching.
The embodiment of the present invention find all P of text in mode be prefix suffix be in Suffix array clustering SA lexicographic order connect
Continuous, the suffix using P as prefix can be thus searched for by binary search method in some section of Suffix array clustering, into
And complete matching search.Matching process is divided into two steps, and step 101 is approximate match, using binary search algorithm to suffix
Array scans for, and determines the range that P is likely to occur in T.Positive binary search determines first with pattern string P in text string T
The initial position sp of the identical suffix of character, it is the suffix of prefix in Suffix array clustering SA that reversed binary search, which is determined using P,
End position ep.Then section SA [sp, ep] can be comprising all using P as the suffix of prefix, and first stage output mode text P can
Section existing for energy [sp, ep].
Step 102 is accurate matching, using step 101 as a result, excluding length in the section [sp, ep] of Suffix array clustering
Less than mode string length and end character and the different suffix of P end character, and then accurate determining P goes out each time in T
Existing position filters out length and the ineligible suffix of ultimate character, further under the premise of initial character is identical again
Reduce seeking scope.In search process, once discovery is greater than the substring of P, then searches for and stop immediately.It is often looked in accurate matching
To a matching, then counter occ adds 1, finally exports matched quantity.
Fig. 2 is flow chart of the embodiment of the present invention based on the first stage in the character string fast matching method of Suffix array clustering,
First stage is used to find possible range of the mode P in Suffix array clustering SA.Its step are as follows：
201) the mode text P that input length is m, length are the text T, Suffix array clustering SA of n；
202) initialize temporary variable sp=1, st=n+1, wherein sp indicate text string T in pattern string P initial character phase
The possible initial position of same suffix；
203) 206) if sp is thened follow the steps not less than st；
204) it is positioned by half, temporary variable s=(sp+st)/2；
205) whether the first character of judgment model P is less than SA [s] a character in T, if it is less than then sp=s+1,
Otherwise st=s；Then step 203) is executed；
206) initialize temporary variable ep=sp-1, et=n, wherein ep indicate text string T in pattern string P initial character phase
The position that the possibility of same suffix terminates；
207) 210) if ep is thened follow the steps not less than et；
208) it is positioned by half, temporary variable e=(ep+et)/2；
209) whether the first character of judgment model P is less than SA [e] a character in T, no if it is less than then ep=e
Then 1 et=e-then executes step 207)；
210) [sp, ep] is exported.
First stage has found range of the pattern string P in Suffix array clustering SA, then carries out accurate of second stage
Match.
Fig. 3 is accurate matching of the embodiment of the present invention based on second stage in the character string fast matching method of Suffix array clustering
Process, its step are as follows：
301) the mode text P that input length is m, length are the text T of n, the result of Suffix array clustering SA and first stage
Sp and ep；
302) temporary variable i=sp, counter occ=0 are initialized；
303) 309) if i is thened follow the steps not less than ep；
304) judge whether i relevant string length in current location is less than pattern string P or ultimate character and pattern string
Ultimate character whether Tong suffix, i.e., whether meet n-SA [i]<M or T [SA [i]+m] ≠ P [m] executes step if meeting
It is rapid 308)；
305) judge whether i relevant character string in current location equal with mode P, that is, judge P whether with T [SA [i], SA
[i]+m] it is equal, if 307) equal then follow the steps；
306) judge whether i relevant character string in current location is greater than mode P, that is, judge whether P is less than T [SA [i], SA
[i]+m], if meeting condition, 310) condition of satisfaction is thened follow the steps, no to then follow the steps 308)；
307) matching is found, match counter occ adds 1；
308) interim cyclic variable i adds 1, then executes step 303)；
309) number of matches occ is exported.
It is starting that appearance position of the pattern string P in text string T is limited to the initial character gone here and there in mode by the present invention first
In the Suffix array clustering section of character, then further limit search criterion on this section, exclude length be less than pattern string with
And the suffix that ultimate character is different from pattern string ultimate character, it is possible to reduce the number of comparisons of character reduces character string simultaneously
The range matched, and then it is quickly obtained appearance position of the pattern string in text string.Matching speed of the invention is better than existing
Method, the time complexity of approximate match search of the present invention are O (logn), and the time complexity of exact match search is O (m*
Occ), wherein occ refers to frequency of occurrence of the P in T, so total time complexity of the invention is O (m*occ+logn), tool
Have the advantages that matching speed is fast and matching precision is high.
Above-described specific embodiment has carried out further the purpose of the present invention, technical scheme and beneficial effects
It is described in detail, it should be understood that being not intended to limit the present invention the foregoing is merely a specific embodiment of the invention
Protection scope, all within the spirits and principles of the present invention, any modification, equivalent substitution, improvement and etc. done should all include
Within protection scope of the present invention.
Claims (3)
1. the character string fast matching method based on Suffix array clustering, it is characterised in that, include the following steps:
1) the Suffix array clustering SA about text string T is established, binary chop then is carried out by pattern string P in text to Suffix array clustering SA again
Appearance position in this string T be limited in mode go here and there P initial character be bebinning character Suffix array clustering section in [sp, ep],
Middle sp indicates the possible initial position of suffix identical with pattern string P initial character in text string T, ep indicate in text string T with
The position that the possibility of the identical suffix of pattern string P initial character terminates；
2) length is excluded on the obtained section of step 1) be less than pattern string P and ultimate character and pattern string P ultimate character
Different suffix, and then obtain appearance position of the pattern string P in text string T.
2. the character string fast matching method according to claim 1 based on Suffix array clustering, which is characterized in that the step
1) include the following steps：
101) the mode text P that input length is m, length are the text T, Suffix array clustering SA of n；
102) temporary variable sp=1, st=n+1 are initialized, wherein sp indicates identical with pattern string P initial character in text string T
The possible initial position of suffix；
103) 106) if sp is thened follow the steps not less than st；
104) it is positioned by half, temporary variable s=(sp+st)/2；
105) first character of judgment model P is no less than SA [s] a character in T, if it is less than then sp=s+1, otherwise
St=s；Then step 103) is executed；
106) temporary variable ep=sp-1, et=n are initialized, wherein ep indicates identical with pattern string P initial character in text string T
The position that the possibility of suffix terminates；
107) 110) if ep is thened follow the steps not less than et；
108) it is positioned by half, temporary variable e=(ep+et)/2；
109) first character of judgment model P is no less than SA [e] a character in T, if it is less than then ep=e, otherwise et
Then=e -1 executes step 107)；
110) [sp, ep] is exported.
3. the character string fast matching method according to claim 1 based on Suffix array clustering, which is characterized in that the step
2) include the following steps:
201) the mode text P that input length is m, length are the text T of n, the sp and ep that Suffix array clustering SA and step 1) obtain；
202) temporary variable i=sp, counter occ=0 are initialized；
203) 209) if i is thened follow the steps not less than ep；
204) judge whether i relevant string length in current location is less than pattern string P or ultimate character and pattern string last bit
Character whether Tong suffix, i.e., whether meet n-SA [i]<M or T [SA [i]+m] ≠ P [m] is thened follow the steps if met
208)；
205) judge whether i relevant character string in current location equal with mode P, that is, judge P whether with T [SA [i], SA [i]+
M] it is equal, if 207) equal then follow the steps；
206) judge whether i relevant character string in current location is greater than mode P, that is, judge P whether be less than T [SA [i], SA [i]+
M], if meeting condition, 210) condition of satisfaction is thened follow the steps, no to then follow the steps 208)；
207) matching is found, match counter occ adds 1；
208) interim cyclic variable i adds 1, then executes step 203)；
209) number of matches occ is exported.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810398497.5A CN108920483B (en) | 2018-04-28 | 2018-04-28 | Suffix array-based character string fast matching method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810398497.5A CN108920483B (en) | 2018-04-28 | 2018-04-28 | Suffix array-based character string fast matching method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108920483A true CN108920483A (en) | 2018-11-30 |
| CN108920483B CN108920483B (en) | 2022-02-01 |
Family
ID=64403484
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810398497.5A Active CN108920483B (en) | 2018-04-28 | 2018-04-28 | Suffix array-based character string fast matching method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108920483B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110597855A (en) * | 2019-08-14 | 2019-12-20 | 中山大学 | Data storage method, terminal equipment and computer readable storage medium |
| CN111476037A (en) * | 2020-04-14 | 2020-07-31 | 腾讯科技（深圳）有限公司 | Text processing method and device, computer equipment and storage medium |
| CN112100455A (en) * | 2020-08-18 | 2020-12-18 | 北京理工大学 | LZW dictionary searching method based on character string parallel search |
Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020123995A1 (en) * | 2001-01-11 | 2002-09-05 | Tetsuo Shibuya | Pattern search method, pattern search apparatus and computer program therefor, and storage medium thereof |
| WO2010119783A1 (en) * | 2009-04-13 | 2010-10-21 | 株式会社日立製作所 | Pair character string retrieval system |
| CN102073740A (en) * | 2011-01-27 | 2011-05-25 | 农革 | String suffix array construction method on basis of radix sorting |
| CN102081673A (en) * | 2011-01-27 | 2011-06-01 | 农革 | Suffix array construction method |
| CN103412858A (en) * | 2012-07-02 | 2013-11-27 | 清华大学 | Method for large-scale feature matching of text content or network content analyses |
| CN105141583A (en) * | 2015-07-28 | 2015-12-09 | 中国电子科技集团公司第三十六研究所 | Character string matching method and system |
| CN105335481A (en) * | 2015-10-14 | 2016-02-17 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Large scale character string text suffix index building method and device |
| CN105468588A (en) * | 2014-05-30 | 2016-04-06 | 华为技术有限公司 | Character string matching method and apparatus |
| CN105653567A (en) * | 2014-12-04 | 2016-06-08 | 南京理工大学常熟研究院有限公司 | Method for quickly looking for feature character strings in text sequential data |
| CN107229759A (en) * | 2017-07-27 | 2017-10-03 | 深圳市乐宜科技有限公司 | A kind of method of character string pattern matching |
| CN107341224A (en) * | 2017-06-30 | 2017-11-10 | 北方工业大学 | The matching process and device of a kind of character string |
| US20170351780A1 (en) * | 2013-03-15 | 2017-12-07 | Micron Technology, Inc. | Inexact Search Acceleration |
-
2018
- 2018-04-28 CN CN201810398497.5A patent/CN108920483B/en active Active
Patent Citations (12)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20020123995A1 (en) * | 2001-01-11 | 2002-09-05 | Tetsuo Shibuya | Pattern search method, pattern search apparatus and computer program therefor, and storage medium thereof |
| WO2010119783A1 (en) * | 2009-04-13 | 2010-10-21 | 株式会社日立製作所 | Pair character string retrieval system |
| CN102073740A (en) * | 2011-01-27 | 2011-05-25 | 农革 | String suffix array construction method on basis of radix sorting |
| CN102081673A (en) * | 2011-01-27 | 2011-06-01 | 农革 | Suffix array construction method |
| CN103412858A (en) * | 2012-07-02 | 2013-11-27 | 清华大学 | Method for large-scale feature matching of text content or network content analyses |
| US20170351780A1 (en) * | 2013-03-15 | 2017-12-07 | Micron Technology, Inc. | Inexact Search Acceleration |
| CN105468588A (en) * | 2014-05-30 | 2016-04-06 | 华为技术有限公司 | Character string matching method and apparatus |
| CN105653567A (en) * | 2014-12-04 | 2016-06-08 | 南京理工大学常熟研究院有限公司 | Method for quickly looking for feature character strings in text sequential data |
| CN105141583A (en) * | 2015-07-28 | 2015-12-09 | 中国电子科技集团公司第三十六研究所 | Character string matching method and system |
| CN105335481A (en) * | 2015-10-14 | 2016-02-17 | 广东顺德中山大学卡内基梅隆大学国际联合研究院 | Large scale character string text suffix index building method and device |
| CN107341224A (en) * | 2017-06-30 | 2017-11-10 | 北方工业大学 | The matching process and device of a kind of character string |
| CN107229759A (en) * | 2017-07-27 | 2017-10-03 | 深圳市乐宜科技有限公司 | A kind of method of character string pattern matching |
Non-Patent Citations (1)
| Title |
|---|
| 胥永康 等: ""基于压缩后缀数组的近似字符串匹配算法"", 《计算机工程与应用》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110597855A (en) * | 2019-08-14 | 2019-12-20 | 中山大学 | Data storage method, terminal equipment and computer readable storage medium |
| CN110597855B (en) * | 2019-08-14 | 2022-03-29 | 中山大学 | Data query method, terminal device and computer readable storage medium |
| CN111476037A (en) * | 2020-04-14 | 2020-07-31 | 腾讯科技（深圳）有限公司 | Text processing method and device, computer equipment and storage medium |
| CN111476037B (en) * | 2020-04-14 | 2023-03-31 | 腾讯科技（深圳）有限公司 | Text processing method and device, computer equipment and storage medium |
| CN112100455A (en) * | 2020-08-18 | 2020-12-18 | 北京理工大学 | LZW dictionary searching method based on character string parallel search |
| CN112100455B (en) * | 2020-08-18 | 2022-09-20 | 北京理工大学 | LZW dictionary searching method based on character string parallel search |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108920483B (en) | 2022-02-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109241274B (en) | Text clustering method and device | |
| CN101398820B (en) | Large scale key word matching method | |
| CN108846016B (en) | Chinese word segmentation oriented search algorithm | |
| CN106959962B (en) | A kind of multi-pattern match method and apparatus | |
| CN108920483A (en) | Character string fast matching method based on Suffix array clustering | |
| CN107784110B (en) | Index establishing method and device | |
| CN102867049B (en) | Chinese PINYIN quick word segmentation method based on word search tree | |
| SaiKrishna et al. | String matching and its applications in diversified fields | |
| Harichandran et al. | Bytewise approximate matching: the good, the bad, and the unknown | |
| Dutta et al. | Neighbor-aware search for approximate labeled graph matching using the chi-square statistics | |
| CN116562297B (en) | Chinese sensitive word deformation identification method and system based on HTRIE tree | |
| CN105045808A (en) | Composite rule set matching method and system | |
| Michelson et al. | Unsupervised information extraction from unstructured, ungrammatical data sources on the world wide web | |
| JP7412935B2 (en) | How to convert source code to numeric identifiers and compare them against a dataset | |
| CN102521357A (en) | System and method for achieving accurate matching of texts by automaton | |
| CN108304467B (en) | Method for matching between texts | |
| CN115577269A (en) | Blacklist fuzzy matching method based on character string text feature similarity | |
| CN105553483B (en) | A kind of method and device generating LZ77 | |
| CN112464648B (en) | Industry standard blank feature recognition system and method based on multi-source data analysis | |
| Chayapathi | Survey and comparison of string matching algorithms | |
| CN113065419A (en) | Pattern matching algorithm and system based on flow high-frequency content | |
| Clifford et al. | Pseudo-realtime pattern matching: Closing the gap | |
| Sharma et al. | An approach for frequent access pattern identification in web usage mining | |
| CN109657108B (en) | Domain name asset data storage and query method and system | |
| Deusdado et al. | GRASPm: an efficient algorithm for exact pattern-matching in genomic sequences |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |