  We show that reconstructing a tree from order information on triples is
NP-hard. This is in contrast to the case for ultra-metrics and for subtree
information on quadruples which are both known to allow polynomial time
reconstruction.

Combinatorics