Message sequence check is an important part of network security detection in smart substations, in which pattern matching is its key algorithm. However, the current matching algorithms have the problem of low efficiency when facing matching situations with high pattern string repetition and many adjacent repeated characters or fields. Therefore, a new algorithm called H-Sunday algorithm has been proposed. Firstly, the repeated adjacent characters both in the pattern string and the source string have been replaced by short and compressed characters. Then, a maximum right movement for the compressed pattern string and source string is carried out, which greatly improves the efficiency in pattern matching process for the pattern string and source string. Both the experimental results as well as the real application in substation, show that the proposed one has higher matching efficiency by comparing with existing classical pattern matching algorithms.
No takes yet. Share an insight, caveat, or question.
Wang et al. (2024) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: