Sciweavers

312 search results - page 60 / 63
» On distance and similarity in fold space
Sort
View
SODA
2001
ACM
188views Algorithms» more  SODA 2001»
14 years 10 months ago
Approximation algorithms for the 0-extension problem
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
Gruia Calinescu, Howard J. Karloff, Yuval Rabani
BMCBI
2010
112views more  BMCBI 2010»
14 years 9 months ago
In silico fragmentation for computer assisted identification of metabolite mass spectra
Background: Mass spectrometry has become the analytical method of choice in metabolomics research. The identification of unknown compounds is the main bottleneck. In addition to t...
Sebastian Wolf, Stephan Schmidt, Matthias Mül...
BMCBI
2008
114views more  BMCBI 2008»
14 years 9 months ago
Visualizing and clustering high throughput sub-cellular localization imaging
Background: The expansion of automatic imaging technologies has created a need to be able to efficiently compare and review large sets of image data. To enable comparisons of imag...
Nicholas A. Hamilton, Rohan D. Teasdale
CVIU
2008
124views more  CVIU 2008»
14 years 9 months ago
Measuring novelty and redundancy with multiple modalities in cross-lingual broadcast news
News videos from different channels, languages are broadcast everyday, which provide abundant information for users. To effectively search, retrieve, browse and track news stories...
Xiao Wu, Alexander G. Hauptmann, Chong-Wah Ngo
87
Voted
BMCBI
2007
143views more  BMCBI 2007»
14 years 9 months ago
RNAspa: a shortest path approach for comparative prediction of the secondary structure of ncRNA molecules
Background: In recent years, RNA molecules that are not translated into proteins (ncRNAs) have drawn a great deal of attention, as they were shown to be involved in many cellular ...
Yair Horesh, Tirza Doniger, Shulamit Michaeli, Ron...