Bounds on the Expected Size of the Maximum Agreement Subtree
We prove polynomial upper and lower bounds on the expected size of the maximum agreement subtree of two random binary phylogenetic trees under both the uniform distribution and Yule-Harding distribution. This positively answers a question posed in earlier work. Determining tight upper and lower bounds remains an open problem.
Code (0)
등록된 구현이 없습니다.
Similar Papers 제목 키워드 기반
Model Agreement via Anchoring
Numerous lines of aim to control $\textit{model disagreement}$ -- the extent to which two machine learning models disagree in their predictions. We adopt a simple and standard notion of model disagreement in real-valued …
Improving Neural RST Parsing Model with Silver Agreement Subtrees
Most of the previous Rhetorical Structure Theory (RST) parsing methods are based on supervised learning such as neural networks, that require an annotated corpus of sufficient size and quality. However, the RST Discourse…
Discourse ParsingRelationCOSPEDTree-II: Improved Couplet based Phylogenetic Supertree
A Supertree synthesizes the topologies of a set of phylogenetic trees carrying overlapping taxa set. In process, conflicts in the tree topologies are aimed to be resolved with the consensus clades. Such a problem is prov…
Min-Mid-Max Scaling, Limits of Agreement, and Agreement Score
In this paper, I solve a 60-year old question posed by Cohen's seminal paper (1960) and offer an agreement measure centered around the chance-expected agreement while isolating marginally forced agreement and disagreemen…
The GFB Tree and Tree Imbalance Indices
Tree balance plays an important role in various research areas in phylogenetics and computer science. Typically, it is measured with the help of a balance index or imbalance index. There are more than 25 such indices ava…