Title :
On searching of all occurrences of a word in a string
Author :
Dogaru, Octavian ; Dogaru, Roxana
Author_Institution :
West Univ. of Timisoara, Romania
Abstract :
This paper presents a string search algorithm. The method is one of search to find all occurrences of a word p of m characters in a string s of n characters, 0<m⩽n. The upper bound of the number of comparisons to determine that p is not in s, in the worst case, is m(n-m+1)
Keywords :
computational complexity; pattern matching; search problems; text analysis; all word occurrences; number of comparisons; random number sequences; string search algorithm; text characters; time complexity; upper bound; Pattern matching; Upper bound;
Conference_Titel :
Electronics, Circuits and Systems, 1999. Proceedings of ICECS '99. The 6th IEEE International Conference on
Conference_Location :
Pafos
Print_ISBN :
0-7803-5682-9
DOI :
10.1109/ICECS.1999.812350
