Figure 3

Algorithm execution example. This figure refers to the data in Figure 2. The first index, i, represents the row and the second index, j, represents the column. The third index, s, represents the total number of mutations at amino acids i and j. Beginning in position (2,1,90), we then add (3,1,80) to the stack, then {(4,1,70), (3,2,70)} and so forth. After each addition to the stack, we pick the element with the highest value in the third position of the 3-tuple.