‘Bureaucratic’ set systems, and their role in phylogenetics

We say that a collection CC of subsets of XX is bureaucratic   if every maximal hierarchy on XX contained in CC is also maximum. We characterize bureaucratic set systems and show how they arise in phylogenetics. This framework has several useful algorithmic consequences: we generalize some earlier results and derive a polynomial-time algorithm for a parsimony problem arising in phylogenetic networks.