๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Searching for Most Parsimonious Trees with Simulated Evolutionary Optimization

โœ Scribed by Atte Moilanen

Book ID
115593491
Publisher
John Wiley and Sons
Year
1999
Tongue
English
Weight
112 KB
Volume
15
Category
Article
ISSN
0748-3007

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An O(n) algorithm for finding an optimal
An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree
โœ B.Y. Wu; C.Y. Tang ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 477 KB

An O(n) algorithm for finding an optimal position with relative distances in an evolutionary tree is presented in this paper. The optimality of position is defined by minimum incremental distance under Lx-norm. The algorithm can also be used to solve similar problems with alternative criteria, such