Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...

String matching is the problem of finding all the occurrences of a pattern in a text. We present a new method to compute the combinatorial shift function (“matching shift”) of the well-known Boyer–Moore string matching algorithm. This method implies the computation of the length of the longest suffixes of the pattern ending at each position in this pattern. These values constituted an extra-pre...

Educators were catapulted forward in their thinking about scholarship in 1990 when Boyer proposed a broader definition. Research, the discovery of new knowledge, is the traditionally recognised form of scholarship. Boyer conceptualised research as representing only a single form and identified the areas of application, integration and teaching also as scholarship. Any type of scholarship advanc...

A number of new algorithms for regular grammar pattern matching is presented. The new algorithms handle patterns speci ed by regular grammars | a generalization of multiple keyword pattern matching and single keyword pattern matching, both considered extensively in and [14, Chapter 4] and in [18]. Among the algorithms is a Boyer-Moore type algorithm for regular grammar pattern matching, answeri...

Abstra t. We present a variation of the Fast-Sear h string mat hing algorithm, a re ent member of the large family of Boyer-Moore-like algorithms, and we ompare it with some of the most e e tive string mat hing algorithms, su h as Horspool, Qui k Sear h, Tuned Boyer-Moore, Reverse Fa tor, Berry-Ravindran, and Fast-Sear h itself. All algorithms are ompared in terms of run-time e ien y, number of...

Once upon a time, not so very long ago, before restriction enzymes were ordered from a New England Biolabs catalog and vectors arrived in neat packages from Promega, and before molecular biologists added patents or a company to their CV, there was Herb Boyer. One can almost define the revolution in molecular genetics by Herb’s story alone—the discovery of the iconic restriction enzyme EcoR1 and...

Given a set {x1, x2, . . . , xn}, each element of which is colored either red or blue, we must determine an element of the majority color by making equal/not equal color comparisons xu : xv; when n is even, we must report that there is no majority if there are equal numbers of each color. How many such questions are necessary and sufficient? It is easy to obtain an algorithm using at most n−ν(n...

We present a Boyer-Moore approach to string matching over LZ78 and LZW compressed text. The key idea is that, despite that we cannot exactly choose which text characters to inspect, we can still use the characters explicitly represented in those formats to shift the pattern in the text. We present a basic approach and more advanced ones. Despite that the theoretical average complexity does not ...

The Boyer and Moore (BM) pattern matching algorithm is considered as one of the best, but its performance is reduced on binary data. Yet, searching in binary texts has important applications, such as compressed matching. The paper shows how, by means of some pre-computed tables, one may implement the BM algorithm also for the binary case without referring to bits, and processing only entire blo...

Hydrogel preparation under NIR light via a photoinduced RAFT polymerization catalyzed by tetrasulfonated zinc phthalocyanine is reported Cyrille Boyer et al. in their Research Article (e202302451). Exploiting enhanced penetration of light, gelation effectively performed through barriers. Thiocarbonylthio groups embedded hydrogel networks facilitate the reactivation polymer chains wavelengths, e...