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

Optimization of Polytomies: State Set and Parallel Operations

โœ Scribed by Pablo A. Goloboff


Publisher
Elsevier Science
Year
2002
Tongue
English
Weight
87 KB
Volume
22
Category
Article
ISSN
1055-7903

No coin nor oath required. For personal study only.

โœฆ Synopsis


New algorithms for calculating the most parsimonious state sets for polytomies under Fitch parsimony are described. Because they are based on state set operations, these algorithms can be extended for optimization of several characters in parallel, thus increasing speed by a significant factor. This speed increase may facilitate analysis of molecular data sets, many of which contain hundreds of taxa, thousands of multistate nonadditive characters, and numerous polytomies.


๐Ÿ“œ SIMILAR VOLUMES


Transformations on the sets of states an
โœ Lajos Molnรกr; Werner Timmermann ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 136 KB

In this paper we consider two physically relevant numerical quantities (namely, the concurrence and -fidelity) and an operation (called โ™ฆ-product) defined on the set of all quantum states or density operators. Our main aim is to present the complete descriptions of all bijective transformations whic