Sciweavers

263 search results - page 12 / 53
» Stochastic pairwise alignments
Sort
View
TOG
2008
253views more  TOG 2008»
13 years 7 months ago
4-points congruent sets for robust pairwise surface registration
We introduce 4PCS, a fast and robust alignment scheme for 3D point sets that uses wide bases, which are known to be resilient to noise and outliers. The algorithm allows registeri...
Dror Aiger, Niloy J. Mitra, Daniel Cohen-Or
CPM
1998
Springer
115views Combinatorics» more  CPM 1998»
13 years 12 months ago
Aligning Alignments
d abstract) John Kececioglu and Dean Starrett Department of Computer Science The University of Arizona Tucson AZ 85721, USA A basic computational problem that arises in both the...
John D. Kececioglu, Weiqing Zhang
GCB
2004
Springer
139views Biometrics» more  GCB 2004»
14 years 1 months ago
Graph Alignments: A New Concept to Detect Conserved Regions in Protein Active Sites
: We introduce the novel concept of graph alignment, a generalization of graph isomorphism that is motivated by the commonly used multiple sequence alignments. Graph alignments and...
Nils Weskamp, Eyke Hüllermeier, Daniel Kuhn, ...
BIBE
2008
IEEE
142views Bioinformatics» more  BIBE 2008»
14 years 2 months ago
Optimizing performance, cost, and sensitivity in pairwise sequence search on a cluster of PlayStations
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...
Ashwin M. Aji, Wu-chun Feng
NIPS
2008
13 years 9 months ago
Mixed Membership Stochastic Blockmodels
Consider data consisting of pairwise measurements, such as presence or absence of links between pairs of objects. These data arise, for instance, in the analysis of protein intera...
Edoardo Airoldi, David M. Blei, Stephen E. Fienber...