By Topic

Improved text scanning approach for exact String matching

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Muhammad Zubair ; Department of Computing and Technology, Iqra University, Islamabad Campus, Pakistan ; Fazal Wahab ; Iftikhar Hussain ; Junaid Zaffar

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.

Published in:

Information and Emerging Technologies (ICIET), 2010 International Conference on

Date of Conference:

14-16 June 2010