Polymorphic malware is currently difficult to identify. Such malware is able to mutate into functionally equivalent variants of themselves. Modern detection techniques are not adequate against this rapidly-mutating po...
详细信息
string matching is of great importance in pattern recognition. We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with...
详细信息
ISBN:
(纸本)9781479972593
string matching is of great importance in pattern recognition. We put forth a new string matching algorithm which matches the pattern from neither the left nor the right end, instead a special position. Comparing with the Knuth-Morris-Pratt algorithm and the Boyer-Moore algorithm, the new algorithm is more flexible to pick the position for starting comparisons. The option really brings it a saving in cost. The method requires a statistical probability table for alphabets which can be set up using evolution strategies for dynamic conditions. If the chosen lowlight character in a given pattern has the probability lambda, the length of the text is n and the length of the pattern is m. then we conjecture that the complexity of the new algorithm is Theta(n/lambda m).
Efficient extraction of strings or sub-strings similar to an input query string forms a necessity in applications like instant search, record linkage, etc., where the similarity between two strings is usually quantifi...
详细信息
string matching is a fundamental problem in computer science, and has been widely used in many important fields. This paper improves the classic BM type algorithm, Quick Search Using multiple sliding window method, th...
详细信息
Code similarity detection has been studied for several decades, which are prevailing categorized into attributecounting and structure-metric. Due to the one fold validity of attribute-counting for full replication, ma...
详细信息
ISBN:
(纸本)9789897581076
Code similarity detection has been studied for several decades, which are prevailing categorized into attributecounting and structure-metric. Due to the one fold validity of attribute-counting for full replication, mature systems usually use the GST string matching algorithm to detect code structure. However, the accuracy of GST is vulnerable to interference in code similarity detection. This paper presents a code similarity detection method combining string matching and sub-graph isomorphism. The similarity is calculated with the GST algorithm. Then according to the similarity, the system determines whether further processing with the subgraph iIsomorphism algorithm is required. Extensive experimental results illustrate that our method significantly enhances the efficiency of string matching as well as the accuracy of code similarity detecting.
string matching is the classical problem of finding all occurrences of a pattern in a text. A real-time string matching algorithm takes worst-case constant-time to check if a pattern occurrence ends at each text locat...
详细信息
Multi-pattern string matching has become the performance bottleneck of many important application fields. In this article, a q-grams method for BNDM type algorithms named Uq-grams which simulates the bit mask table fo...
详细信息
searching for all occurrences of a pattern in a text is a fundamental problem in computer science with applications in many other fields, like natural language processing, information retrieval and computational biolo...
详细信息
The classical string matching algorithms are facing a great challenge on speed due to the rapid growth of information on Internet. Meanwhile, multi-core CPU has been widespread on computers. But classical string match...
详细信息
string Matching is one of the most basic problems in computer science. This paper presented a general research method for calculating the jump distance of q-grams bad-char rule which is named figure example method for...
详细信息
暂无评论