indeterminate strings
Recently Published Documents


TOTAL DOCUMENTS

11
(FIVE YEARS 0)

H-INDEX

4
(FIVE YEARS 0)

Author(s):  
Felipe A. Louza ◽  
Neerja Mhaskar ◽  
W.F. Smyth


2017 ◽  
Vol 698 ◽  
pp. 25-39 ◽  
Author(s):  
Maxime Crochemore ◽  
Costas S. Iliopoulos ◽  
Tomasz Kociumaka ◽  
Jakub Radoszewski ◽  
Wojciech Rytter ◽  
...  


2016 ◽  
Vol 60 (3) ◽  
pp. 473-497 ◽  
Author(s):  
F. Blanchet-Sadri ◽  
Michelle Bodnar ◽  
Benjamin De Winkle


2015 ◽  
Vol 600 ◽  
pp. 34-48 ◽  
Author(s):  
Manolis Christodoulakis ◽  
P.J. Ryan ◽  
W.F. Smyth ◽  
Shu Wang


BMC Genomics ◽  
2014 ◽  
Vol 15 (S6) ◽  
Author(s):  
Daniel Doerr ◽  
Jens Stoye ◽  
Sebastian Böcker ◽  
Katharina Jahn


Author(s):  
Maxime Crochemore ◽  
Costas S. Iliopoulos ◽  
Tomasz Kociumaka ◽  
Jakub Radoszewski ◽  
Wojciech Rytter ◽  
...  


2009 ◽  
Vol 20 (06) ◽  
pp. 985-1004 ◽  
Author(s):  
W. F. SMYTH ◽  
SHU WANG

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.



2008 ◽  
Vol 6 (1) ◽  
pp. 37-50 ◽  
Author(s):  
Jan Holub ◽  
W.F. Smyth ◽  
Shu Wang




Sign in / Sign up

Export Citation Format

Share Document