Sciweavers

4 search results - page 1 / 1
» A graph approach to the threshold all-against-all substring ...
Sort
View
JEA
2008
56views more  JEA 2008»
13 years 4 months ago
A graph approach to the threshold all-against-all substring matching problem
Marina Barsky, Ulrike Stege, Alex Thomo, Chris Upt...
SWAT
2004
Springer
98views Algorithms» more  SWAT 2004»
13 years 10 months ago
Tight Approximability Results for Test Set Problems in Bioinformatics
In this paper, we investigate the test set problem and its variations that appear in a variety of applications. In general, we are given a universe of objects to be “distinguish...
Piotr Berman, Bhaskar DasGupta, Ming-Yang Kao
ICCV
2005
IEEE
13 years 10 months ago
Robust Point Matching for Two-Dimensional Nonrigid Shapes
Recently, nonrigid shape matching has received more and more attention. For nonrigid shapes, most neighboring points cannot move independently under deformation due to physical co...
Yefeng Zheng, David S. Doermann
BMCBI
2007
137views more  BMCBI 2007»
13 years 4 months ago
Bayesian refinement of protein functional site matching
Background: Matching functional sites is a key problem for the understanding of protein function and evolution. The commonly used graph theoretic approach, and other related appro...
Kanti V. Mardia, Vysaul B. Nyirongo, Peter J. Gree...