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...
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...
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...
Fei Wang, Baba C. Vemuri, Tanveer Fathima Syeda-Ma...
—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...
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...