Sciweavers

213 search results - page 42 / 43
» A criterion for coarse iterability
Sort
View
CVPR
2008
IEEE
14 years 9 months ago
Probabilistic graph and hypergraph matching
We consider the problem of finding a matching between two sets of features, given complex relations among them, going beyond pairwise. Each feature set is modeled by a hypergraph ...
Ron Zass, Amnon Shashua
ISNN
2005
Springer
14 years 29 days ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu
BMCBI
2010
154views more  BMCBI 2010»
13 years 7 months ago
Fine-tuning structural RNA alignments in the twilight zone
Background: A widely used method to find conserved secondary structure in RNA is to first construct a multiple sequence alignment, and then fold the alignment, optimizing a score ...
Andreas Bremges, Stefanie Schirmer, Robert Giegeri...
BMCBI
2008
126views more  BMCBI 2008»
13 years 7 months ago
NITPICK: peak identification for mass spectrometry data
Background: The reliable extraction of features from mass spectra is a fundamental step in the automated analysis of proteomic mass spectrometry (MS) experiments. Results: This co...
Bernhard Y. Renard, Marc Kirchner, Hanno Steen, Ju...
BMCBI
2008
140views more  BMCBI 2008»
13 years 7 months ago
Improved accuracy of multiple ncRNA alignment by incorporating structural information into a MAFFT-based framework
Background: Structural alignment of RNAs is becoming important, since the discovery of functional non-coding RNAs (ncRNAs). Recent studies, mainly based on various approximations ...
Kazutaka Katoh, Hiroyuki Toh