Study of Pattern-matching Based on Greedy Principle
In the process of string,one of the most important operations is the pattern-matching,with the key problem how to improve the searching efficiency.To support efficient string matching,we propose a methodology exploring pattern feature with the most optimum strategy on the basis of greedy principle.According to the feature values of the characters in the string,all the characters are matched descending.On analysing the difference and/or consistence weight between the neighbor substrings with feature and/or strategy optimization,four algorithms are proposed in details.Extensive experiments are conducted to show that our methodology offers significant performance advantages over other existing string matching methods,especially on efficiency、adaptability and extendibility.