`Bureaucratic' set systems, and their role in phylogenetics

DOI10.1016/J.AML.2012.02.026zbMATH Open1248.05035arXiv1106.1723OpenAlexW2962956690MaRDI QIDQ449344FDOQ449344

Authors: David Bryant, Mike Steel 

Publication date: 30 August 2012

Published in: Applied Mathematics Letters (Search for Journal in Brave)

Abstract: We say that a collection $Cc$ of subsets of $X$ is {em bureaucratic} if every maximal hierarchy on $X$ contained in $Cc$ is also maximum. We characterise 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.

Full work available at URL: https://arxiv.org/abs/1106.1723

Recommendations

• Extension operations on sets of leaf-labelled trees
• Binets: fundamental building blocks for phylogenetic networks
• A subdivision approach to maximum parsimony
• On computing the maximum parsimony score of a phylogenetic network
• Parsimonious cluster systems

zbMATH Keywords

treeclusterhierarchyphylogeneticsalgorithm

Mathematics Subject Classification ID

Applications of graph theory (05C90) Genetics and epigenetics (92D10) Trees (05C05)

Cites Work

• Title not available (Why is that?)
• The dissection of rectangles into squares
• Weak hierarchies associated with similarity measures - An additive clustering technique

Uses Software

• Tanglegrams

This page was built for publication: `Bureaucratic' set systems, and their role in phylogenetics

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q449344)