Skip to Main Content
Exact String matching is an important subject in the domain of text processing and an essential component in practical applications of computer system. In this research we proposed a new algorithm to solve the problem of exact string matching by scanning text string for last and first characters of pattern in its preprocessing phase. In matching phase of TSPLFC (Test Scanning for Pattern Last and First Character) compares pattern with text window from both directions simultaneously. Experimental results verify that TSPLFC is efficient than number of existing algorithms and take its time complexity is O(km) in average case and O(1) in best case.
Date of Conference: 14-16 June 2010