** 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 *C*_{min}. Since we will only be using *C*_{min}
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 *T*_{min}.

*Chantal Korostensky*

*1999-07-14*