An improved bound on the maximum agreement subtree problem

DOI10.1016/j.aml.2009.06.019zbMath1177.05026arXiv0903.3386OpenAlexW2069910147WikidataQ41845390 ScholiaQ41845390MaRDI QIDQ1036838

László A. Székely, Mike A. Steel

Publication date: 13 November 2009

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

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

zbMATH Keywords

binary treephylogenycaterpillarphylogenetic treecyclic ordermaximum agreement subtree

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (4)

Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees ⋮ On the extremal maximum agreement subtree problem ⋮ The maximum agreement subtree problem ⋮ On the Maximum Agreement Subtree Conjecture for Balanced Trees

Uses Software

• PAUP*

Cites Work

• Unnamed Item
• Unnamed Item
• Reconstructing the shape of a tree from observed dissimilarity data
• Consensus supertrees: The synthesis of rooted trees containing overlapping sets of labeled leaves
• Kaikoura tree theorems: Computing the maximum agreement subtree
• The agreement metric for labeled binary trees
• Cyclic permutations and evolutionary trees
• An algorithm to find agreement subtrees
• Tree structures for proximity data

This page was built for publication: An improved bound on the maximum agreement subtree problem