Sciweavers

427 search results - page 9 / 86
» Computing the Local Consensus of Trees
Sort
View
51
Voted
ICWMC
2006
IEEE
15 years 3 months ago
Localized Tree Change Multicast Protocol for Mobile Ad Hoc Networks
T. Srinivasan, Chandrasekar Ramachandran, Vivek Vi...
BIOINFORMATICS
2002
100views more  BIOINFORMATICS 2002»
14 years 9 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
ICNC
2005
Springer
15 years 2 months ago
Local Search for the Maximum Parsimony Problem
Abstract. Four local search algorithms are investigated for the phylogenetic tree reconstruction problem under the Maximum Parsimony criterion. A new subtree swapping neighborhood ...
Adrien Goëffon, Jean-Michel Richer, Jin-Kao H...
CVPR
2012
IEEE
12 years 12 months ago
From label fusion to correspondence fusion: A new approach to unbiased groupwise registration
Label fusion strategies are used in multi-atlas image segmentation approaches to compute a consensus segmentation of an image, given a set of candidate segmentations produced by r...
Paul A. Yushkevich, Hongzhi Wang, John Pluta, Bria...