Bit-Parallel Algorithms for Exact Circular String Matching

We propose two algorithms that perform searching a circular string on text using bit-parallel technique. Our algorithms only use the composition of bitwise-logical operations and basic arithmetic operations, and apply this technique to solve the problem.

Source Code:

1. CSBNDM (32 bits version)(Updated on Jan., 22, 2013)

2. CSBNDq (32 bits version)(Updated on Jan., 22, 2013)

3. CSBNDM2b (32 bits version)(Updated on Jan., 22, 2013)

4. CSBNDM4b (32 bits version)(Updated on Jan., 22, 2013)

5. CSBNDM6b (32 bits version)(Updated on Jan., 22, 2013)

6. CSBNDM8b (32 bits version)(Updated on Jan., 22, 2013)

Experimental Data:

Random Text Alphabet Size
Text
Pattern
2
4
8

16

 


DNA
Length
Text
Pattern
90908613
84213159
100537107
115591997