The input of the DCTC algorithm is a set of quartet splits.
The algorithm computes the closure of the set of quartet splits.
If there ar contradictory pairs of quartet splits in the closure, then the algorithm returns the value: INCONSISTENT.
If there is a quartet for which there is no quartet split in the closure, the algorithm returns the value: INSUFFICIENT.
If neither of these cases happens the algorithm keeps on working with the closure of the set of quartet splits.
It can be proved that in this case the underlying tree can be reconstructed.
The algorithm reconstructs and returns the tree in the usual format (see: tree.txt).
 
 
 
 
    ©1999  All Rights Reserved e-mail the Pagemaster     GoBack