Title of article
An improved bound on the maximum agreement subtree problem
Author/Authors
Steel، نويسنده , , Mike and Székely، نويسنده , , Lلszlَ A.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2009
Pages
3
From page
1778
To page
1780
Abstract
We improve the lower bound on the extremal version of the maximum agreement subtree problem. Namely we prove that two binary trees on the same n leaves have subtrees with the same ≥ c log log n leaves which are homeomorphic, such that homeomorphism is the identity on the leaves.
Keywords
Phylogeny , Phylogenetic tree , Maximum agreement subtree , caterpillar , Binary tree , Cyclic order
Journal title
Applied Mathematics Letters
Serial Year
2009
Journal title
Applied Mathematics Letters
Record number
1526401
Link To Document