Sciweavers

654 search results - page 6 / 131
» On the Approximation of Computing Evolutionary Trees
Sort
View
RECOMB
2001
Springer
16 years 1 months ago
Fast recovery of evolutionary trees with thousands of nodes
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...
Miklós Csürös
RECOMB
2005
Springer
16 years 1 months ago
Maximum Likelihood of Evolutionary Trees Is Hard
Benny Chor, Tamir Tuller
PPSN
2010
Springer
14 years 11 months ago
Fixed Parameter Evolutionary Algorithms and Maximum Leaf Spanning Trees: A Matter of Mutation
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...
Stefan Kratsch, Per Kristian Lehre, Frank Neumann,...
METMBS
2004
140views Mathematics» more  METMBS 2004»
15 years 2 months ago
New Techniques for Generation and Analysis of Evolutionary Trees
We introduce new distance measures for the construction and analysis of phylogenies, focusing on thioredoxin-fold proteins. Our distance measures for tree construction are based o...
Chang Wang, Stephen D. Scott, Qingping Tao, Dmitri...