On the extremal maximum agreement subtree problem

DOI10.1016/j.dam.2020.07.007zbMath1447.05056arXiv1812.06951OpenAlexW3043286155MaRDI QIDQ2197478

Alexey Markin

Publication date: 31 August 2020

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

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

zbMATH Keywords

lower boundlabeled treesphylogenetic treesmaximum agreement subtree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items (2)

Maximum agreement subtrees and Hölder homeomorphisms between Brownian trees ⋮ 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
• The maximum agreement subtree problem
• An O(nlog n) Algorithm for the Maximum Agreement Subtree Problem for Binary Trees
• Bounds on the Expected Size of the Maximum Agreement Subtree
• Maximum Agreement Subtree in a Set of Evolutionary Trees: Metrics and Efficient Algorithms
• Bounds on the Expected Size of the Maximum Agreement Subtree for a Given Tree Shape

This page was built for publication: On the extremal maximum agreement subtree problem