𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Phylogenetic trees and evolutionary forests

✍ Scribed by Jonathan Marks


Publisher
John Wiley and Sons
Year
2005
Tongue
English
Weight
100 KB
Volume
14
Category
Article
ISSN
1060-1538

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Forests of label-increasing trees
✍ John Riordan πŸ“‚ Article πŸ“… 1979 πŸ› John Wiley and Sons 🌐 English βš– 210 KB

Label-increasing trees are fully labeled rooted trees with the restriction that the labels are in increasing order on every path from the root; the best known example is the binary case-no tree with more than two branches at the root, or internal vertices of degree greater than threeextensively exam

Uniform and minimal essential spanning f
✍ Olle HΓ€ggstrΓΆm πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 252 KB

Uniform and minimal random spanning trees for finite graphs are well-known objects. Analogues of these for the nearest-neighbor graph on Z d have been studied by Pemantle and Alexander. Here we propose analogous definitions of uniform resp. minimal essential spanning forests for an infinite tree ⌫,

cover
✍ Johnson, Allan πŸ“‚ Fiction πŸ“… 2014 πŸ› Temple University Press 🌐 English βš– 166 KB πŸ‘ 2 views
Efficient Merging and Construction of Ev
✍ Andrzej Lingas; Hans Olsson; Anna Γ–stlin πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 99 KB

In this paper we study the algorithmic problem of constructing rooted evolutionary trees in the so-called experiment model. This model was first presented by Ε½ Ε½ . .

Seeing the forest and the trees
✍ Charles Lockwood πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 49 KB
A novel approach to phylogenetic trees:
✍ M. Brazil; D.A. Thomas; B.K. Nielsen; P. Winter; C. Wulff-Nilsen; M. Zachariasen πŸ“‚ Article πŸ“… 2009 πŸ› John Wiley and Sons 🌐 English βš– 146 KB

## Abstract We suggest a novel distance‐based method for the determination of phylogenetic trees. It is based on multidimensional scaling and Euclidean Steiner trees in high‐dimensional spaces. Preliminary computational experience shows that the use of Euclidean Steiner trees for finding phylogenet