✦ LIBER ✦

A novel approach to phylogenetic trees: d-Dimensional geometric Steiner trees

✍ Scribed by M. Brazil; D.A. Thomas; B.K. Nielsen; P. Winter; C. Wulff-Nilsen; M. Zachariasen

Publisher: John Wiley and Sons
Year: 2009
Tongue: English
Weight: 146 KB
Volume: 53
Category: Article
ISSN: 0028-3045
DOI: 10.1002/net.20279

No coin nor oath required. For personal study only.

✦ Synopsis

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 phylogenetic trees is a viable approach. Experiments also indicate that the new method is comparable with results produced by neighbor joining (Saitou and Nei, Mol Biol Evol 4 (1987), 406–425). © 2008 Wiley Periodicals, Inc. NETWORKS, 2009

📜 SIMILAR VOLUMES

A polynomial time algorithm for rectilin

A polynomial time algorithm for rectilinear Steiner trees with terminals constrained to curves

✍ Brazil, M.; Thomas, D. A.; Weng, J. F. 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 168 KB 👁 2 views

The rectilinear Steiner problem is the problem of constructing the shortest rectilinear network in the plane connecting a given set of points, called terminals. The problem is known to be NP-complete in general. In this paper, we show that there is a polynomial time algorithm for solving the rectili

ChemInform Abstract: By Cyclodehydration

ChemInform Abstract: By Cyclodehydration to Centropolyindans: Development of a Novel Class of Indan Hydrocarbons with Tree-Dimensional Molecular Frameworks Using a Classical Synthetic Tool

✍ D. KUCK 📂 Article 📅 2010 🏛 John Wiley and Sons ⚖ 24 KB