Next: Idea of the algorithm
Up: Using Traveling Salesman Problem
Previous: Error Bound
We now present a tree construction algorithm that is based on this
circular order Cmin. Since we will only be using Cmin
from now on, we will refer to that order with C only. The input
for the algorithm is the PAM distances of the pairwise alignments plus
the circular order C of the optimal tree Tmin.