Sciweavers

133 search results - page 16 / 27
» The early introduction of dynamic programming into computati...
Sort
View
ECCV
1998
Springer
14 years 9 months ago
Matching Hierarchical Structures Using Association Graphs
?It is well-known that the problem of matching two relational structures can be posed as an equivalent problem of finding a maximal clique in a (derived) ?association graph.? Howev...
Marcello Pelillo, Kaleem Siddiqi, Steven W. Zucker
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
2006
179views more  BMCBI 2006»
13 years 7 months ago
Multiscale Hy3S: Hybrid stochastic simulation for supercomputers
Background: Stochastic simulation has become a useful tool to both study natural biological systems and design new synthetic ones. By capturing the intrinsic molecular fluctuation...
Howard Salis, Vassilios Sotiropoulos, Yiannis N. K...
MSOM
2010
65views more  MSOM 2010»
13 years 2 months ago
The Optimal Composition of Influenza Vaccines Subject to Random Production Yields
The Vaccine and Related Biologic Products Advisory Committee meets at least once a year to decide the composition of the influenza vaccine in the U.S. Past evidence suggests that ...
Soo-Haeng Cho
TCS
2008
13 years 7 months ago
Algorithms for computing variants of the longest common subsequence problem
The longest common subsequence(LCS) problem is one of the classical and wellstudied problems in computer science. The computation of the LCS is a frequent task in DNA sequence ana...
Costas S. Iliopoulos, M. Sohel Rahman