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 |