796 search results - page 9 / 160 » Generalized Commitment Alignment |
162
click to vote
WABI
2009
Springer
16 years 12 days ago
2009
Springer
We present a novel dynamic programming framework that allows one to compute tight upper bounds for the p-values of gapped local alignments in pseudo–polynomial time. Our algorith...
196
click to vote
CVPR
2009
IEEE
17 years 28 days ago
2009
IEEE
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...
172
Voted
IPMI
2009
Springer
16 years 18 days ago
2009
Springer
This paper proposes a novel and robust approach to the groupwise point-sets registration problem in the presence of large amounts of noise and outliers. Each of the point sets is r...
165
Voted
PAMI
2011
15 years 23 days ago
2011
—In this paper, we introduce a novel method to solve shape alignment problems. We use gray-scale “images” to represent source shapes, and propose a novel two-component Gaussi...
148
click to vote
BMCBI
2010
15 years 6 months ago
2010
Background: DNA sequence comparison is a well-studied problem, in which two DNA sequences are compared using a weighted edit distance. Recent DNA sequencing technologies however o...