1099 search results - page 121 / 220 » On the Complexity of Computing Evolutionary Trees |
ALT
1995
Springer
15 years 1 months ago
1995
Springer
This paper characterizes the polynomial time learnability of TPk, the class of collections of at most k rst-order terms. A collection in TPk de nes the union of the languages de n...
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...
GPEM
2008
14 years 10 months ago
2008
Efficiency enhancement techniques--such as parallelization and hybridization--are among the most important ingredients of practical applications of genetic and evolutionary algori...
CHI
2010
ACM
15 years 4 months ago
2010
ACM
We present Apatite, a new tool that aids users in learning and understanding a complex API by visualizing the common associations between its various components. Current object-or...
ALMOB
2008
14 years 10 months ago
2008
Motivation: Sequence-based methods for phylogenetic reconstruction from (nucleic acid) sequence data are notoriously plagued by two effects: homoplasies and alignment errors. Larg...