Sciweavers

1261 search results - page 19 / 253
» Approximation algorithms for aligning points
Sort
View
COMGEO
2010
ACM
14 years 9 months ago
Approximation algorithm for the kinetic robust K-center problem
Clustering is an important problem and has numerous applications. In this paper we consider an important clustering problem, called the k-center problem. We are given a discrete p...
Sorelle A. Friedler, David M. Mount
BIBE
2005
IEEE
126views Bioinformatics» more  BIBE 2005»
15 years 3 months ago
Suboptimal Alignments Improve the Detection of Weak Homologs in Sequence Database Searches
PSI-BLAST remains one of the popular tools for searching remote homologs in sequence databases. We recently demonstrated that hybrid alignment can function as the alignment core f...
Yuheng Li, Mario Lauria, Ralf Bundschuh
NAR
2010
140views more  NAR 2010»
14 years 4 months ago
GUIDANCE: a web server for assessing alignment confidence scores
Evaluating the accuracy of multiple sequence alignment (MSA) is critical for virtually every comparative sequence analysis that uses an MSA as input. Here we present the GUIDANCE ...
Osnat Penn, Eyal Privman, Haim Ashkenazy, Giddy La...
ICPP
2003
IEEE
15 years 2 months ago
FastLSA: A Fast, Linear-Space, Parallel and Sequential Algorithm for Sequence Alignment
Pairwise sequence alignment is a fundamental operation for homology search in bioinformatics. For two DNA or protein sequences of length ¢ and £ , full-matrix (FM), dynamic prog...
Adrian Driga, Paul Lu, Jonathan Schaeffer, Duane S...
CVPR
2008
IEEE
15 years 11 months ago
Articulated shape matching using Laplacian eigenfunctions and unsupervised point registration
Matching articulated shapes represented by voxel-sets reduces to maximal sub-graph isomorphism when each set is described by a weighted graph. Spectral graph theory can be used to...
Diana Mateus, Radu Horaud, David Knossow, Fabio Cu...