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 and its indeterminate successor. However, as discussed in this paper, because of the special properties of indeterminate stri...
| Main Authors: | , |
|---|---|
| Format: | Journal Article |
| Published: |
World Scientific
2009
|
| Subjects: | |
| Online Access: | http://hdl.handle.net/20.500.11937/46034 |
| _version_ | 1848757448796536832 |
|---|---|
| author | Smyth, Bill Wang, S. |
| author_facet | Smyth, Bill Wang, S. |
| author_sort | Smyth, Bill |
| building | Curtin Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-14T09:28:16Z |
| format | Journal Article |
| id | curtin-20.500.11937-46034 |
| institution | Curtin University Malaysia |
| institution_category | Local University |
| last_indexed | 2025-11-14T09:28:16Z |
| publishDate | 2009 |
| publisher | World Scientific |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | curtin-20.500.11937-460342019-02-19T05:35:18Z An adaptive hybrid pattern-matching algorithm on indeterminate strings Smyth, Bill Wang, S. adaptive Indeterminate Strings hybrid 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. 2009 Journal Article http://hdl.handle.net/20.500.11937/46034 10.1142/S0129054109007005 World Scientific fulltext |
| spellingShingle | adaptive Indeterminate Strings hybrid Smyth, Bill Wang, S. An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title | An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title_full | An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title_fullStr | An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title_full_unstemmed | An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title_short | An adaptive hybrid pattern-matching algorithm on indeterminate strings |
| title_sort | adaptive hybrid pattern-matching algorithm on indeterminate strings |
| topic | adaptive Indeterminate Strings hybrid |
| url | http://hdl.handle.net/20.500.11937/46034 |