-
Let at i = E1 level J1 be
reached using r1
-
Once the point (i,J1) then three pieces of
information are stored in a three-level array for
(i,J1)
1. An information about the word associated with
r1
2. Minimum cost Dmin(i,J1)required to
reach the point (i,J1) for the reference string
r1
3. The starting point leading to (i,J1)
-
Instead of moving to the second level, the second candidate
reference string r2 is taken into
consideration and the above process is repeated again
-
If Dmin(r2) < Dmin(r1) then the storage arrays for word
one is replaced by that of word two
-
This process is repeated for each reference string that can
possibly be the first word in the string,rv,v
= 1,2,...,V