2019
DOI: 10.1007/s00285-019-01377-w
|View full text |Cite
|
Sign up to set email alerts
|

A balance index for phylogenetic trees based on rooted quartets

Abstract: We define a new balance index for rooted phylogenetic trees based on the symmetry of the evolutive history of every set of 4 leaves. This index makes sense for multifurcating trees and it can be computed in time linear in the number of leaves. We determine its maximum and minimum values for arbitrary and bifurcating trees, and we provide exact formulas for its expected value and variance on bifurcating trees under Ford's α-model and Aldous' β-model and on arbitrary trees under the α-γ-model. of isomorphisms of… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

2
38
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5
2

Relationship

3
4

Authors

Journals

citations
Cited by 16 publications
(40 citation statements)
references
References 33 publications
2
38
0
Order By: Relevance
“…And for each number n ⩽ 183 of leaves, the minimum V value among all rooted bifurcating trees with n leaves is reached at the maximally balanced trees, those bifurcating trees where the descendant leaves of every internal node split among its pair of children into two subsets of cardinalities differing at most in 1. This is in agreement with other balance indices, like the Sackin index [13], the Colless index [8], the total cophenetic index [27], and the rooted quartets index [9], that classify as most balanced these maximally balanced trees (tied with other trees in the case of Sackin's and Colless' indices, and only them in the case of the other two indices). These maximally balanced trees were called "the most balanced trees" by Shao and Sokal [37].…”
Section: Introductionsupporting
confidence: 88%
See 3 more Smart Citations
“…And for each number n ⩽ 183 of leaves, the minimum V value among all rooted bifurcating trees with n leaves is reached at the maximally balanced trees, those bifurcating trees where the descendant leaves of every internal node split among its pair of children into two subsets of cardinalities differing at most in 1. This is in agreement with other balance indices, like the Sackin index [13], the Colless index [8], the total cophenetic index [27], and the rooted quartets index [9], that classify as most balanced these maximally balanced trees (tied with other trees in the case of Sackin's and Colless' indices, and only them in the case of the other two indices). These maximally balanced trees were called "the most balanced trees" by Shao and Sokal [37].…”
Section: Introductionsupporting
confidence: 88%
“…These maximally balanced trees were called "the most balanced trees" by Shao and Sokal [37], and they yield the minimum values -among the bifurcating trees with their number of leaves-of the Sackin index [13], the Colless index [8], the total cophenetic index [27], and the rooted quartets index [9]; for the first two balance indices, this minimum value may also be reached at other trees, while for the last two indices it is achieved only at the maximally balanced trees. Moreover, as we mentioned, when n is a power of 2, B n is fully symmetric.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…The degree of balance of a phylogenetic tree is usually measured by means of balance indices. Several such indices have been proposed so far [7,9,14,24,25,27,28,35,37] (see also the section "Measures of overall asymmetry" in [12,Chap. 33]) and Shao and Sokal [37, p. 273] explicitly advised to "choose more than one index" to quantify the balance of a tree.…”
Section: Introductionmentioning
confidence: 99%