Abstract
This paper makes a research on the exact string matching, proposed a nested classification string matching algorithm. This paper based on the KMP algorithm, constructs the multi-level string matching and use the KR algorithm calculates the next function quickly, in order to replace the traditional KMP algorithm which is using the recursive thinking to calculate the next[j] function value in the large number of pattern string under the premise. Through the use of this method we can reduce the number of matches thereby raising the efficiency.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
