Phylogenetic flexibility via Hall-type inequalities and submodularity

DOI10.1007/s11538-018-0419-1zbMath1410.92074arXiv1710.08946OpenAlexW2964102628WikidataQ88197855 ScholiaQ88197855MaRDI QIDQ1736949

Katharina T. Huber, Vincent L. Moulton, Mike A. Steel

Publication date: 26 March 2019

Published in: Bulletin of Mathematical Biology (Search for Journal in Brave)

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

zbMATH Keywords

bipartite graphsubmodularityphylogenetic treeHall's marriage theoremset systemspartial taxon coverage

Mathematics Subject Classification ID

Problems related to evolution (92D15) Applications of graph theory (05C90)

Related Items (1)

Submodular functions and rooted trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Slim sets of binary trees
• A Hall-type theorem for triplet set systems based on medians in trees
• Characterizing phylogenetically decisive taxon coverage
• Matching theory
• The ellipsoid method and its consequences in combinatorial optimization
• Combinatorial properties of triplet covers for binary trees
• The matroid structure of representative triple sets and triple-closure computation
• Extension operations on sets of leaf-labelled trees
• Resilience and optimization of identifiable bipartite graphs
• Inferring a Tree from Lowest Common Ancestors with an Application to the Optimization of Relational Expressions
• A matroid associated with a phylogenetic tree
• Patchworks

This page was built for publication: Phylogenetic flexibility via Hall-type inequalities and submodularity