An adaptive hybrid pattern-matching algorithm on indeterminate strings

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 [11] and its indeterminate successor [15]. However, as discussed in this paper, because of the special properties of indeterminate strings, it is not straight forward to directly migrate FJS to an indeterminate version. Our new algorithm combines two fast pattern-matching …