𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A Combinatorial Construction For Twin Trees

✍ Scribed by D.G. Fon-Der-Flaass

Publisher
Elsevier Science
Year
1996
Tongue
English
Weight
306 KB
Volume
17
Category
Article
ISSN
0195-6698

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Parallel Construction of (a, b)-Trees
Parallel Construction of (a, b)-Trees
✍ N. Deo; A. Jain; M. Medidi πŸ“‚ Article πŸ“… 1994 πŸ› Elsevier Science 🌐 English βš– 518 KB