Forward Dawg Matching 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 2 3 0  
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
  2 0  
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 2 3 4 5 7 9 1 0  
 
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  
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
  6 0  
Fifth 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
  6 2 3 4 0  
Sixth 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
  6 2 1

The Forward Dawg Matching algorithm performs 24 character comparisons on the example.

Forward Dawg Matching algorithm