A more formal evaluation of this algorithm is required. This has been done with a technique where we generate random EPTs and randomly mutate the sequences. From the resulting mutated sequences at the leaves of the tree we try to reconstruct the multiple alignment. It is easy to verify the accuracy, as we know the correct alignment by construction. The comparisons were done for this and several other algorithms available to us. These results and the description of the methodology exceed the scope of the paper and will be available in .
One problem affects the quality of these multiple alignments. The results are dependent on a correct EPT, which is not always available. Minor errors in the EPT are of little consequence, unless they straddle incorrectly a point where an indel occurred. This causes the same indel to be in separate subtrees of the EPT. The above algorithm will handle this by repeating the indel. As a result the two indels may not match. Heuristics to try to fix this problem include weighting the indels in a special way in the subtrees, but have not been entirely successful. It should be noted that if the EPT is correct then the algorithm described here will work correctly.