✦ LIBER ✦

OVWTRE: A program for optimal variable weighting for ultrametric and additive tree fitting

✍ Scribed by Geert De Soete

Book ID: 105394067
Publisher: Springer
Year: 1988
Tongue: English
Weight: 157 KB
Volume: 5
Category: Article
ISSN: 0176-4268
DOI: 10.1007/bf01901677

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal variable weighting for ultrametr

Optimal variable weighting for ultrametric and additive tree clustering

✍ Geert Soete 📂 Article 📅 1986 🏛 Springer Netherlands 🌐 English ⚖ 417 KB

Computer programs for fitting ultrametri

Computer programs for fitting ultrametric and additive trees to proximity data by least squares methods

✍ De Soete, Geert 📂 Article 📅 1984 🏛 Psychonomic Society Publications 🌐 English ⚖ 358 KB

ADDTREE/P: A PASCAL program for fitting

ADDTREE/P: A PASCAL program for fitting additive trees based on Sattath and Tversky’s ADDTREE algorithm

✍ James G. Orter 📂 Article 📅 1982 🏛 Psychonomic Society Publications 🌐 English ⚖ 235 KB

Maximum a posteriori probability assignm

Maximum a posteriori probability assignment (MAP-A): an optimality criterion for phylogenetic trees via weighting and dynamic programming

✍ Wheeler, Ward C. 📂 Article 📅 2013 🏛 John Wiley and Sons 🌐 English ⚖ 311 KB

A note on Optimal weights and variable s

A note on Optimal weights and variable selections for multivariate survival data

✍ Sihai Dave Zhao; Yi Li 📂 Article 📅 2009 🏛 SP Science China Press 🌐 English ⚖ 117 KB

Efficient Parallel Algorithms for Optima

Efficient Parallel Algorithms for Optimally Locating a Path and a Tree of a Specified Length in a Weighted Tree Network

✍ Biing-Feng Wang 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 128 KB

In this paper, we propose efficient parallel algorithms on the EREW PRAM for optimally locating in a tree network a path-shaped facility and a tree-shaped facility of a specified length. Edges in the tree network have arbitrary positive lengths. Two optimization criteria are considered: minimum ecce