One-Max problem is a well-known benchmark toy problem in evolutionary computation, mainly used to evaluate the performance and search features of stochastic algorithms on binary strings. However, ...

String matching is seen as one of the essential problems in computer science. A variety of computer applications provide the string matching service for their end users. The remarkable boost in the ...