ABSTRACT
The bit-parallelism is a speedup method for solving problems of string matching. The speedup by the bit-parallelism depends on the performance of a computer and it is very significant in practice. In terms of time complexity based on a standard computational model, however, the performance can not be represented explicitly. This paper introduces a parameter in a computational model to measure the performance of a computer, and explicitly analyszs the time complexity of a bit-parallel algorithm for the match-count problem. The implementation of the algorithm and some test calculations are presented.
