Name
Abstract | ||
|---|---|---|
We say that a collection C of subsets of X is bureaucratic if every maximal hierarchy on X contained in 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. |
Year | DOI | Venue |
|---|---|---|
2012 | 10.1016/j.aml.2012.02.026 | Applied Mathematics Letters |
Keywords | Field | DocType |
Cluster,Hierarchy,Tree,Algorithm,Phylogenetics | Discrete mathematics,Phylogenetic tree,Hierarchy,Phylogenetics,Mathematics,Bureaucracy | Journal |
Volume | Issue | ISSN |
25 | 8 | 0893-9659 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| David Bryant | 1 | 65 | 8.91 |
| Mike Steel | 2 | 270 | 41.87 |