Tuned Boyer Moore example


First attempt
G C A T C G C A G A G A G T A T A C A G T A C G
  1  
G C A G A G A G  
 
  2  
  G C A G A G A G  
 
  3  
  G C A G A G A G  
 
  4  
  G C A G A G A G  
 
  5  
  G C A G A G A G  

Shift by: 2 (shift)

Second attempt
G C A T C G C A G A G A G T A T A C A G T A C G
  1  
  G C A G A G A G  
 
  2  
  G C A G A G A G  

Shift by: 2 (shift)

Third attempt
G C A T C G C A G A G A G T A T A C A G T A C G
  1  
  G C A G A G A G  
 
  2 3 4 5 6 7 8  
  G C A G A G A G  

Shift by: 2 (shift)

Fourth attempt
G C A T C G C A G A G A G T A T A C A G T A C G
  1  
  G C A G A G A G  
 
  2  
  G C A G A G A G  
 
  3
  G C A G A G A G
 
  4
  G C A G A G A G
 
  5  
  G C A G A G A G

Shift by: 2 (shift)

The Tuned Boyer Moore algorithm performs 10 character comparisons on the example.

Tuned Boyer Moore algorithm