| Creator |
|
|
|
|
|
|
|
| Language |
|
| Publisher |
|
|
|
| Date |
|
| Source Title |
|
| Vol |
|
| Issue |
|
| First Page |
|
| Last Page |
|
| Publication Type |
|
| Access Rights |
|
| Related DOI |
|
|
|
| Related URI |
|
|
|
| Relation |
|
|
|
| Abstract |
The bit-parallelism is a speedup method for solving problems of string matching. The speedup by the bitparallelism depends on the performance of a computer and it is very significant in practice. In t...erms of time complexity based on a standard computational model, however, the performance cannot be represented explicitly. This paper introduces a parameter in a computational model to measure the performance of a computer, and explicitly analyses the time complexity of a bit-parallel algorithm for the match-count problem. The implementation of the algorithm and some test calculations are presented.show more
|
Export Mendeley
EYBM06