The Binary Jumbled String Matching problem is defined as: Given a string s over {a, b} of length n and a query (x, y), with x, y non-negative integers, decide whether s has a substring t with exactlyâ€¦ (More)

Many metaheuristics such as island models and cellular evolutionary algorithms use a network of distributed populations that communicate search points along a spatial communication topology. The ideaâ€¦ (More)

A word is closed if it contains a proper factor that occurs both as a prefix and as a suffix but does not have internal occurrences. We show that any word of length n contains at least n+ 1 closedâ€¦ (More)

The topic of repeating segments in words is one of major interest in combinatorics on words. The topic has been studied for more than a century by many authors after the seminal work [9] whichâ€¦ (More)