Sciweavers

244 search results - page 13 / 49
» Hybrid Tree Reconstruction Methods
Sort
View
HM
2007
Springer
137views Optimization» more  HM 2007»
14 years 1 months ago
A Hybrid VNS for Connected Facility Location
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
Ivana Ljubic
ISMB
2001
13 years 8 months ago
Designing fast converging phylogenetic methods
Abstract: Absolute fast converging phylogenetic reconstruction methods are provably guaranteed to recover the true tree with high probability from sequences that grow only polynomi...
Luay Nakhleh, Usman Roshan, Katherine St. John, Je...
JCB
2008
71views more  JCB 2008»
13 years 7 months ago
Short Quartet Puzzling: A New Quartet-Based Phylogeny Reconstruction Algorithm
Quartet-based phylogeny reconstruction methods, such as Quartet Puzzling, were introduced in the hope that they might be competitive with maximum likelihood methods, without being...
Sagi Snir, Tandy Warnow, Satish Rao
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
13 years 7 months ago
Optimal algorithms for local vertex quartet cleaning
Reconstructing evolutionary trees is an important problem in biology. A response to the computational intractability of most of the traditional criteria for inferring evolutionary...
Gianluca Della Vedova, Todd Wareham
ROBOCUP
2000
Springer
146views Robotics» more  ROBOCUP 2000»
13 years 11 months ago
Observation Strategy for Decision Making Based on Information Criterion
Self localization seems necessary for mobile robot navigation. The conventional method such as geometric reconstruction from landmark observations is generally time-consuming and ...
Noriaki Mitsunaga, Minoru Asada