𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Complexity of Inferring Rooted Evolutionary Trees

✍ Scribed by Jesper Jansson

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
274 KB
Volume
7
Category
Article
ISSN
1571-0653

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the Total Heights of Random Rooted Bi
On the Total Heights of Random Rooted Binary Trees
✍ 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 spectra of some weighted rooted t
On the spectra of some weighted rooted trees and applications
✍ Oscar Rojo; MarΓ­a Robbiano πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 221 KB

Let T be a weighted rooted tree of k levels such that (1) the vertices in level j have a degree equal to d k-j +1 for j = 1, 2, . . . , k, and (2) the edges joining the vertices in level j with the vertices in level (j + 1) have a weight equal to w k-j for j = 1, 2, . . . , k -1. We give a complete