… 4-Russians approach, but using bit-vector computation instead of table … bit-vector algorithm
for the approximate string matching problem. This is asymptotically superior to prior bit-vector …

… O(1) time using bitvector operations under the assumption that m < w. We begin by choosing
to represent the column Avj with two bit-vectors Pvj and Mvj, whose bits are set according to …

… applying bit-parallelism for exact string matching. … the bit-vector only once and so we are
able to exchange information between alignments. SVM searches only for complete matches …

… If x and y are boolean vectors - or bit vectors -, … , since all the vectors of the form (e G S) can
be precomputed. In the next section, in the particular case of approximate string matching, we …

… bit-parallelism in that situation as at least one-half of the bits in the bit vectors is not used.
Figure 4b depicts our proposal: encode several patterns into the bit vectors and search for them …

… full advantage of bit-parallelism in that situation as at least one half of the bits in the bit
vectors is not used. Fig. 3b depicts our proposal: encode several patterns into the bit vectors and …

… We also consider applying 128-bit vector instructions for bit-parallel computations. … We
first compute bit-parrallely the ∆ vectors for the current block j of columns up to row lj …

… The algorithms reviewed in this section make use of bitwise operations, that is, operations
which operate on one or more bit vectors at the level of their individual bits. On modern …

… so-called ”bit-parallelism” in developing fast and practical algorithms has recently become
popular in the field of string matching. Wu and Manber [WM92] presented an O(d⌈m/w⌉n) bit-…

… We implemented and tested the three bit-parallel variants for approximate string matching
under indel distance. IndelWM and IndelMYE were implemented fully by us, and IndelBYN …