Background: This paper describes techniques for accelerating the performance of the string set matching problem with particular emphasis on applications in computational proteomic...
Yoginder S. Dandass, Shane C. Burgess, Mark Lawren...
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Over the last decades, improvements in CPU speed have outpaced improvements in main memory and disk access rates by orders of magnitude, enabling the use of data compression techn...
We present a theoretical analysis of Watson’s Hierarchicalif-and-only-if (HIFF) problem using a variety of tools. These include schema theory and course graining, the concept of...
The Commonality-Based Crossover Framework has been presented as a general model for designing problem specific operators. Following this model, the Common Features/Random Sample ...
Stephen Y. Chen, Cesar Guerra-Salcedo, Stephen F. ...