Abstract
AbstractTree balance plays an important role in different research areas like theoretical computer science and mathematical phylogenetics. For example, it has long been known that under the Yule model, a pure birth process, imbalanced trees are more likely than balanced ones. Also, concerning ordered search trees, more balanced ones allow for more efficient data structuring than imbalanced ones. Therefore, different methods to measure the balance of trees were introduced. The Sackin index is one of the most frequently used measures for this purpose. In many contexts, statements about the minimal and maximal values of this index have been discussed, but formal proofs have only been provided for some of them, and only in the context of ordered binary (search) trees, not for general rooted trees. Moreover, while the number of trees with maximal Sackin index as well as the number of trees with minimal Sackin index when the number of leaves is a power of 2 are relatively easy to understand, the number of trees with minimal Sackin index for all other numbers of leaves has been completely unknown. In this manuscript, we extend the findings on trees with minimal and maximal Sackin indices from the literature on ordered trees and subsequently use our results to provide formulas to explicitly calculate the numbers of such trees. We also extend previous studies by analyzing the case when the underlying trees need not be binary. Finally, we use our results to contribute both to the phylogenetic as well as the computer scientific literature using the new findings on Sackin minimal and maximal trees to derive formulas to calculate the number of both minimal and maximal phylogenetic trees as well as minimal and maximal ordered trees both in the binary and non-binary settings. All our results have been implemented in the Mathematica package SackinMinimizer, which has been made publicly available.
Publisher
Springer Science and Business Media LLC
Subject
Discrete Mathematics and Combinatorics
Reference28 articles.
1. Blum, M. and Francois, O. 2005. On statistical tests of phylogenetic tree imbalance: The Sackin and other indices revisited. Mathematical Biosciences, 195(2): 141 – 153.
2. Burnside, W. 1897. Theory of groups of finite order. Cambridge University Press.
3. Cameron, H. and Wood, D. 1994. Maximal path length of binary trees. Discrete Applied Mathematics, 55(1): 15 – 35.
4. Cleary, S., Fischer, M., Griffiths, R., and Sainudiin, R. 2015. Some distributions on finite rooted binary trees. http://lamastex.org/preprints/20151231_SomeDistsFRBTrees.pdf.
5. Colless, D. 1982. Review of “Phylogenetics: the theory and practice of phylogenetic systematics”. Systematic Zoology, 31: 100.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献