2026-07-072026-07-07http://salesiana.dossiersoluciones.com/handle/123456789/110066We 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.Combinatoricstext