  We provide a logarithmic upper bound for the disentangling number on
unordered lists of leaf labeled trees. This results is useful for analyzing
phylogenetic mixture models. The proof depends on interpreting multisets of
trees as high dimensional contingency tables.
