Author： Watson B.W. Watson R.E.
Publisher： Elsevier
ISSN： 0167-6423
Source： Science of Computer Programming, Vol.48, Iss.2, 2003-08, pp. : 99-117
Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.
Related content
Correctness of substring-preprocessing in Boyer-Moore's pattern matching algorithm
By Stomp F.
Theoretical Computer Science, Vol. 290, Iss. 1, 2003-01 ,pp. :
Access to resources
Recommend
A new algorithm for linear regular tree pattern matching
By Shankar P. Gantait A. Yuvaraj A.R. Madhavan M.
Theoretical Computer Science, Vol. 242, Iss. 1, 2000-07 ,pp. :
A new regular grammar pattern matching algorithm
By Watson B.W.
Theoretical Computer Science, Vol. 299, Iss. 1, 2003-04 ,pp. :
Approximate Boyer-Moore String Matching for Small Alphabets
By Salmela Leena Tarhio Jorma Kalsi Petri
Algorithmica, Vol. 58, Iss. 3, 2010-11 ,pp. :