1099 search results - page 9 / 220 » On the Complexity of Computing Evolutionary Trees |
RECOMB
2001
Springer
15 years 10 months ago
2001
Springer
We present a novel distance-based algorithm for evolutionary tree reconstruction. Our algorithm reconstructs the topology of a tree with n leaves in O(n2 ) time using O(n) working...
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
RECOMB
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. One of the simplest evolutionary models has molecular sequences evolving from a common ancestor down a bifurcating phylogenetic tree, experiencing point-mutations along t...
PPSN
2010
Springer
14 years 8 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...