Sciweavers

1007 search results - page 66 / 202
» Optimal phylogenetic reconstruction
Sort
View
VMV
2007
122views Visualization» more  VMV 2007»
15 years 1 months ago
An iterative framework for registration with reconstruction
The core of most registration algorithms aligns scan data by pairs, minimizing their relative distance. This local optimization must generally pass through a validation procedure t...
Thales Vieira, Adelailson Peixoto, Luiz Velho, Tho...
ALMOB
2006
138views more  ALMOB 2006»
14 years 12 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
DAM
2010
112views more  DAM 2010»
14 years 12 months ago
New results on optimizing rooted triplets consistency
Abstract. A set of phylogenetic trees with overlapping leaf sets is consistent if it can be merged without conflicts into a supertree. In this paper, we study the polynomial-time a...
Jaroslaw Byrka, Sylvain Guillemot, Jesper Jansson
ISBI
2008
IEEE
15 years 6 months ago
An optimal-path approach for neural circuit reconstruction
Neurobiologists are collecting large amounts of electron microscopy image data to gain a better understanding of neuron organization in the central nervous system. Image analysis ...
Elizabeth Jurrus, Ross T. Whitaker, Bryan W. Jones...
ECCV
2010
Springer
14 years 10 months ago
Element-Wise Factorization for N-View Projective Reconstruction
Sturm-Triggs iteration is a standard method for solving the projective factorization problem. Like other iterative algorithms, this method suffers from some common drawbacks such ...
Yuchao Dai, Hongdong Li, Mingyi He