Computing the Matching

p = length of the matching path P

i :=1;

j := 1;

for k = 1 to p do

if P[k].first = P[k-1].first then

S’[k] := - ;

else

S’[k] := S[i];

i := i + 1;

if P[k].second = P[k-1].second then

T’[k] := - ;

else

T’[k] := T[j];

j := j + 1;

P

0 (0,0)

1 (1,1)

2 (2,2)

3 (3,2)

4 (4,3)

5 (5,4)

6 (5,5)

7 (6,6)

8 (6,7)

first second

Previous slide

Next slide

Back to first slide

View graphic version