1099 search results - page 32 / 220 » On the Complexity of Computing Evolutionary Trees |
ACL2
2006
ACM
15 years 3 months ago
2006
ACM
Biologists studying the evolutionary relationships between organisms use software packages to solve the computational problems they encounter. Several of these problems involve th...
DLT
2003
14 years 11 months ago
2003
In recent years generalized acceptance criteria for different nondeterministic computation models have been examined. Instead of the common definition where an input word is said...
RECOMB
1998
Springer
15 years 2 months ago
1998
Springer
This paper studies various properties of the least common ancestors mapping, the duplication and mutation costs, and the complexity of nding a species tree from gene trees.
COCOON
2006
Springer
15 years 1 months ago
2006
Springer
In a recent article, Nakhleh, Ringe and Warnow introduced perfect phylogenetic networks--a model of language evolution where languages do not evolve via clean speciation--and form...
TOC
2010
14 years 4 months ago
2010
: We show that a noisy parallel decision tree making O(n) queries needs (log n) rounds to compute OR of n bits. This answers a question of Newman [IEEE Conference on Computational ...