✦ LIBER ✦

TESTING METHODS OF EVOLUTIONARY TREE CONSTRUCTION

✍ Scribed by DAVID PENNY; M. D. HENDY

Book ID: 114698430
Publisher: John Wiley and Sons
Year: 1985
Tongue: English
Weight: 730 KB
Volume: 1
Category: Article
ISSN: 0748-3007
DOI: 10.1111/j.1096-0031.1985.tb00427.x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the Complexity of Constructing Evolut

On the Complexity of Constructing Evolutionary Trees

✍ Leszek Gasieniec; Jesper Jansson; Andrzej Lingas; Anna Östlin 📂 Article 📅 1999 🏛 Springer US 🌐 English ⚖ 111 KB

Efficient Merging and Construction of Ev

Efficient Merging and Construction of Evolutionary Trees

✍ 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 Ž Ž . .

On the consensus construction of an evol

On the consensus construction of an evolutionary tree

✍ James B. McGuire 📂 Article 📅 1979 🏛 Elsevier Science ⚖ 781 KB

Different tests, different conclusions:

Different tests, different conclusions: evolutionary trees

✍ Thomas Buckley 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 15 KB

Numerical Methods for Inferring Evolutio

Numerical Methods for Inferring Evolutionary Trees

✍ Joseph Felsenstein 📂 Article 📅 1982 🏛 University of Chicago Press 🌐 English ⚖ 637 KB

A Structured Family of Clustering and Tr

A Structured Family of Clustering and Tree Construction Methods

✍ David Bryant; Vincent Berry 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 190 KB

A cluster A is an Apresjan cluster if every pair of objects within A is more similar than either is to any object outside A. The criterion is intuitive, compelling, but often too restrictive for applications in classification. We therefore explore extensions of Apresjan clustering to a family of rel