Research on a Matching Model Based on EB Environment and It's Algorithm

After discussing the real meaning of the problem of item-by-item repeat matchs based on the same attribution possessed, this paper gives a concept of item-by-item repeat matchs based on the same attribution in the EB environment and every cases of the match. The definition of the largest repeating matching, smellest repeating match, general match and their judge rule are also given. A exact solving algorithm is proposed. It's time complexity is analyzed. The result of the algrithm time complexity is n Sm. A improving algorithm, the complexity of which is O(C) is also easily operating by manual.