𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Some combinatorial properties of dyadic trees

✍ Scribed by L.A. Khizder

Publisher
Elsevier Science
Year
1966
Weight
296 KB
Volume
6
Category
Article
ISSN
0041-5553

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Combinatorial properties of some macrocy
Combinatorial properties of some macrocyclic polyhex systems
✍ Sherif El-Basil πŸ“‚ Article πŸ“… 1992 πŸ› Elsevier Science 🌐 English βš– 256 KB

Explicit formulae are given for the number of Clar structures, C (which represent maximal independent sets of vertices), of several classes of corona-condensed polyhex systems (primitive coronoids). There is a striking equivalence between expressions for c and K, the KekulC counts for the classes re

A General Random Combinatorial Model of
A General Random Combinatorial Model of Botanical Trees
✍ Paul Kruszewski; Sue Whitesides πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 406 KB

We present a new mathematical model of botanical trees capable of simulating the combinatorial structure of specific species based on their bifurcation ratios. We first describe a general combinatorial model of botanical trees for the purposes of synthetic imagery. We apply techniques from probabili

A combinatorial description of the close
A combinatorial description of the closest tree algorithm for finding evolutionary trees
✍ Michael D. Hendy πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 382 KB

The closest tree algorithΒ’a for estimating the evolutionary history of n species, from a set of homologous DNA or RNA sequences is designed to avoid the problem of inconsistency inherent in current methods. The algorithm, as previously described, required O(n~2 n) steps, making it impractical for va