1099 search results - page 11 / 220 » On the Complexity of Computing Evolutionary Trees |
WABI
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. We present two algorithms for computing the quartet distance between trees of arbitrary degree. The quartet distance between two unrooted evolutionary trees is the number...
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
ICES
2001
Springer
15 years 2 months ago
2001
Springer
Abstract. Evolutionary methods are now beginning to be used routinely in design applications. However, even with computing speeds growing continuously, for many complex design prob...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
An investigation is conducted into the effects of a complex mapping between genotype and phenotype upon a simulated evolutionary process. A model of embryogeny is utilised to grow ...
DCC
2005
IEEE
15 years 9 months ago
2005
IEEE
ct A very fast, low complexity algorithm for resolution scalable and random access decoding is presented. The algorithm is based on AGP (Alphabet and Group Partitioning) [1], where...