On the extremal maximum agreement subtree problem
A Markin - Discrete Applied Mathematics, 2020 - Elsevier
Given two phylogenetic trees with leaf set {1,…, n} the maximum agreement subtree problem
asks what is the maximum size of the subset A⊆{1,…, n} such that the two trees are …
asks what is the maximum size of the subset A⊆{1,…, n} such that the two trees are …
On the largest common subtree of random leaf-labeled binary trees
DJ Aldous - SIAM Journal on Discrete Mathematics, 2022 - SIAM
The size of the largest common subtree (maximum agreement subtree) of two independent
uniform random binary trees on n leaves is known to be between orders n^1/8 and n^1/2. By …
uniform random binary trees on n leaves is known to be between orders n^1/8 and n^1/2. By …
Universal rooted phylogenetic tree shapes and universal tanglegrams
We provide an $\Omega (n\log n) $ lower bound and an $ O (n^ 2) $ upper bound for the
smallest size of rooted binary trees (aka phylogenetic tree shapes), which are universal for …
smallest size of rooted binary trees (aka phylogenetic tree shapes), which are universal for …
An improved lower bound on the largest common subtree of random leaf-labeled binary trees
A Khezeli - SIAM Journal on Discrete Mathematics, 2024 - SIAM
It is known that the size of the largest common subtree (ie, the maximum agreement subtree)
of two independent random binary trees with given labeled leaves is of order between and …
of two independent random binary trees with given labeled leaves is of order between and …
[图书][B] Combinatorial Problems in Trees and Graphical Models
P Misra - 2021 - search.proquest.com
Algebraic statistics is a relatively new area of research which explores the connection
between algebraic geometry and statistics. This thesis deals with problems based on the …
between algebraic geometry and statistics. This thesis deals with problems based on the …