Murdoch University Research Repository

Welcome to the Murdoch University Research Repository

The Murdoch University Research Repository is an open access digital collection of research
created by Murdoch University staff, researchers and postgraduate students.

Learn more

An adaptive hybrid pattern-matching algorithm on indeterminate strings

Smyth, W.F. and Wang, S. (2009) An adaptive hybrid pattern-matching algorithm on indeterminate strings. International Journal of Foundations of Computer Science, 20 (6). pp. 985-1004.

PDF - Authors' Version
Download (319kB)
Link to Published Version:
*Subscription may be required


We describe a hybrid pattern-matching algorithm that works on both regular and indeterminate strings. This algorithm is inspired by the recently proposed hybrid algorithm FJS and its indeterminate successor. However, as discussed in this paper, because of the special properties of indeterminate strings, it is not straightforward to directly migrate FJS to an indeterminate version. Our new algorithm combines two fast pattern-matching algorithms, ShiftAnd and BMS (the Sunday variant of the Boyer-Moore algorithm), and is highly adaptive to the nature of the text being processed. It avoids using the border array, therefore avoids some of the cases that are awkward for indeterminate strings. Although not always the fastest in individual test cases, our new algorithm is superior in overall performance to its two component algorithms — perhaps a general advantage of hybrid algorithms.

Item Type: Journal Article
Publisher: World Scientific Publishing Co.
Copyright: © 2009 World Scientific Publishing Co Pte Ltd
Item Control Page Item Control Page


Downloads per month over past year