๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

On the Combinatorics of Rooted Binary Phylogenetic Trees

โœ Scribed by YunS. Song


Publisher
Springer
Year
2003
Tongue
English
Weight
253 KB
Volume
7
Category
Article
ISSN
0218-0006

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


On the Total Heights of Random Rooted Bi
โœ L. Takacs ๐Ÿ“‚ Article ๐Ÿ“… 1994 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 306 KB

Denote by \(S_{n}\) the set of all distinct rooted binary trees with \(n\) unlabeled vertices. Define \(\sigma_{n}\) as a total height of a tree chosen at random in the set \(S_{n}\), assuming that all the possible choices are equally probable. The total height of a tree is defined as the sum of the

On the Automorphism Group of the One-Roo
โœ A.M. Brunner; Said Sidki ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 339 KB

Let A be the automorphism group of the one-rooted regular binary tree T and 2 G the subgroup of A consisting of those automorphisms admitting a ''finite ลฝ . description'' in their action on T . Let N G be the normaliser of G in A, let 2 A ลฝ . ลฝ . Aut G be the group of automorphisms of G, and let End

The combinatorics of binary arrays
โœ Man Keung Siu ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 714 KB

This paper gives an account of the combinatorics of binary arrays, mainly concerning their randomness properties. In many cases the problem reduces to the investigation on difference sets.

The Characterization of Topology: A Comp
โœ G.M. Berntson ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 388 KB

The quantification of the topological features of binary trees has been applied in several branches of biology, from botany to neurobiology to animal behaviour. The methods available for quantifying tree topology differ, both in how they are applied and how they relate to one another. In this paper,