Sciweavers

32 search results - page 5 / 7
» Multiple View Region Matching as a Lagrangian Optimization P...
Sort
View
FUIN
2006
98views more  FUIN 2006»
13 years 7 months ago
On-line Approximate String Matching in Natural Language
We consider approximate pattern matching in natural language text. We use the words of the text as the alphabet, instead of the characters as in traditional string matching approac...
Kimmo Fredriksson
RECOMB
2007
Springer
14 years 7 months ago
Pairwise Global Alignment of Protein Interaction Networks by Matching Neighborhood Topology
We describe an algorithm, IsoRank, for global alignment of two protein-protein interaction (PPI) networks. IsoRank aims to maximize the overall match between the two networks; in c...
Rohit Singh, Jinbo Xu, Bonnie Berger
IPPS
2010
IEEE
13 years 5 months ago
Large neighborhood local search optimization on graphics processing units
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...
Thé Van Luong, Nouredine Melab, El-Ghazali ...
BMCBI
2004
141views more  BMCBI 2004»
13 years 7 months ago
Estimates of statistical significance for comparison of individual positions in multiple sequence alignments
Background: Profile-based analysis of multiple sequence alignments (MSA) allows for accurate comparison of protein families. Here, we address the problems of detecting statistical...
Ruslan Sadreyev, Nick V. Grishin
DAGM
2006
Springer
13 years 11 months ago
Segmentation-Based Motion with Occlusions Using Graph-Cut Optimization
Abstract. We propose to tackle the optical flow problem by a combination of two recent advances in the computation of dense correspondences, namely the incorporation of image segme...
Michael Bleyer, Christoph Rhemann, Margrit Gelautz