1099 search results - page 30 / 220 » On the Complexity of Computing Evolutionary Trees |
CORR
2010
Springer
14 years 10 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
COCO
1991
Springer
15 years 1 months ago
1991
Springer
We consider the deterministic and the randomized decision tree complexities for Boolean functions, denoted DC(f) and RC(f), respectively. A major open problem is how small RC(f) ca...
ECAL
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. An evolutionary system is presented which employs an embryogeny model to evolve phenotypes in the form of layout of cells in specific patterns and shapes. It is shown th...
RECOMB
2010
Springer
14 years 7 months ago
2010
Springer
(Motivation) Tree reconciliation is an approach that explains the discrepancies between two evolutionary trees by a number of events such as speciations, duplications, transfers an...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Inference of phylogenetic trees using the maximum likelihood (ML) method is NP-hard. Furthermore, the computation of the likelihood function for huge trees of more than 1,000 orga...