Sciweavers

112 search results - page 1 / 23
» The Performance of Phylogenetic Methods on Trees of Bounded ...
Sort
View
WABI
2001
Springer
13 years 9 months ago
The Performance of Phylogenetic Methods on Trees of Bounded Diameter
We study the convergence rates of neighbor-joining and several new phylogenetic reconstruction methods on families of trees of bounded diameter. Our study presents theoretically ob...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
ALGORITHMICA
1999
87views more  ALGORITHMICA 1999»
13 years 4 months ago
The Performance of Neighbor-Joining Methods of Phylogenetic Reconstruction
We analyze the performance of the popular class of neighbor-joining methods of phylogeny reconstruction. In particular, we find conditions under which these methods will determine ...
Kevin Atteson
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
13 years 8 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
SODA
2004
ACM
124views Algorithms» more  SODA 2004»
13 years 6 months ago
On contract-and-refine transformations between phylogenetic trees
The inference of evolutionary trees using approaches which attempt to solve the maximum parsimony (MP) and maximum likelihood (ML) optimization problems is a standard part of much...
Ganeshkumar Ganapathy, Vijaya Ramachandran, Tandy ...
GECCO
2004
Springer
129views Optimization» more  GECCO 2004»
13 years 10 months ago
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys
Permutations of vertices can represent constrained spanning trees for evolutionary search via a decoder based on Prim’s algorithm, and random keys can represent permutations. Tho...
Bryant A. Julstrom