Sciweavers

386 search results - page 7 / 78
» Efficient Parallel Algorithm for Optimal Three-Sequences Ali...
Sort
View
CVPR
2009
IEEE
15 years 3 months ago
Global Optimization for Alignment of Generalized Shapes
In this paper, we introduce a novel algorithm to solve global shape registration problems. We use gray-scale “images” to represent source shapes, and propose a novel twocompo...
Hongsheng Li (Lehigh University), Tian Shen (Lehig...
GECCO
2004
Springer
137views Optimization» more  GECCO 2004»
14 years 1 months ago
Evolving Better Multiple Sequence Alignments
Aligning multiple DNA or protein sequences is a fundamental step in the analyses of phylogeny, homology and molecular structure. Heuristic algorithms are applied because optimal mu...
Luke Sheneman, James A. Foster
IPPS
2009
IEEE
14 years 2 months ago
Parallel reconstruction of neighbor-joining trees for large multiple sequence alignments using CUDA
Computing large multiple protein sequence alignments using progressive alignment tools such as ClustalW requires several hours on state-of-the-art workstations. ClustalW uses a th...
Yongchao Liu, Bertil Schmidt, Douglas L. Maskell
3DIM
2001
IEEE
13 years 11 months ago
Efficient Variants of the ICP Algorithm
The ICP (Iterative Closest Point) algorithm is widely used for geometric alignment of three-dimensional models when an initial estimate of the relative pose is known. Many variant...
Szymon Rusinkiewicz, Marc Levoy
ESCIENCE
2007
IEEE
13 years 12 months ago
Grid-Enabling an Efficient Algorithm for Demanding Global Optimization Problems in Genetic Analysis
Abstract. We study the implementation on grid systems of an efficient algorithm for demanding global optimization problems. Specifically, we consider problems arising in the geneti...
Mahen Jayawardena, Sverker Holmgren