id: 06074540
dt: j
an: 06074540
au: Bryant, David; Steel, Mike
ti: ‘Bureaucratic’ set systems, and their role in phylogenetics.
so: Appl. Math. Lett. 25, No. 8, 1148-1152 (2012).
py: 2012
pu: Elsevier Science Ltd. (Pergamon), Oxford
la: EN
cc: 
ut: cluster; hierarchy; tree; algorithm; phylogenetics
ci: 
li: doi:10.1016/j.aml.2012.02.026
ab: Summary: We say that a collection $\cal C$ of subsets of X is bureaucratic
    if every maximal hierarchy on X contained in $\cal C$ 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.
rv: