The input of the DCM algorithm is is a set of aligned sequences.
From this sequences it constructs a set of quartet splits using the Four Point Method.
These quartet splits are ordered according to their width.
The DCM algorithm keeps looking for a width w (using binary search) for which the DCTC algorithm returns a tree on the set of quartet split whose width is less than w.
If such a w exists the DCM algorithm returns the tree in the usual format (see: tree.txt)
If such a w does not exist, it returns the value: Fail.
 
 
 
 
 

 
 
 

  ©1999  All Rights Reserved e-mail the Pagemaster     GoBack