@article{(Open Science Index):https://publications.waset.org/pdf/7400,
	  title     = {String Matching using Inverted Lists },
	  author    = {Chouvalit Khancome and  Veera Boonjing},
	  country	= {},
	  institution	= {},
	  abstract     = {This paper proposes a new solution to string matching problem. This solution constructs an inverted list representing a  string pattern to be searched for. It then uses a new algorithm to process an input string in a single pass. The preprocessing phase  takes 1) time complexity O(m) 2) space complexity O(1) where m is  the length of pattern. The searching phase time complexity takes 1)  O(m+α ) in average case 2) O(n/m) in the best case and 3) O(n) in  the worst case, where α is the number of comparing leading to  mismatch and n is the length of input text.
},
	    journal   = {International Journal of Computer and Information Engineering},
	  volume    = {1},
	  number    = {1},
	  year      = {2007},
	  pages     = {39 - 43},
	  ee        = {https://publications.waset.org/pdf/7400},
	  url   	= {https://publications.waset.org/vol/1},
	  bibsource = {https://publications.waset.org/},
	  issn  	= {eISSN: 1307-6892},
	  publisher = {World Academy of Science, Engineering and Technology},
	  index 	= {Open Science Index 1, 2007},
	}