The maximum agreement subtree problem

DOI10.1016/j.dam.2013.02.037zbMath1286.05029arXiv1201.5168OpenAlexW2108608076MaRDI QIDQ2446824

Daniel M. Martin, Bhalchandra D. Thatte

Publication date: 22 April 2014

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

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

zbMATH Keywords

phylogeneticsmaximum agreement subtree

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Extremal problems in graph theory (05C35)

Related Items (9)

Bounds on the Expected Size of the Maximum Agreement Subtree ⋮ Inducibility in Binary Trees and Crossings in Random Tanglegrams ⋮ Extremal distances for subtree transfer operations in binary trees ⋮ Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees ⋮ On the extremal maximum agreement subtree problem ⋮ Largest Weight Common Subtree Embeddings with Distance Penalties ⋮ Trees with large numbers of subtrees ⋮ Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape ⋮ On the Maximum Agreement Subtree Conjecture for Balanced Trees

Cites Work

• Unnamed Item
• Unnamed Item
• An improved bound on the maximum agreement subtree problem
• Kaikoura tree theorems: Computing the maximum agreement subtree

This page was built for publication: The maximum agreement subtree problem