On the Maximum Agreement Subtree Conjecture for Balanced Trees
From MaRDI portal
Publication:5028359
DOI10.1137/20M1379678zbMath1482.05037arXiv2005.07357OpenAlexW3024252031WikidataQ113779065 ScholiaQ113779065MaRDI QIDQ5028359
Magnus Bordewich, Megan Owen, Katherine St. John, Charles Semple, Simone Linz, Kristina Wicke
Publication date: 9 February 2022
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2005.07357
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- An improved bound on the maximum agreement subtree problem
- Kaikoura tree theorems: Computing the maximum agreement subtree
- The agreement metric for labeled binary trees
- On the extremal maximum agreement subtree problem
- The maximum agreement subtree problem
- Maximum agreement and compatible supertrees
- 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 Maximum Agreement Subtree Conjecture for Balanced Trees