Sciweavers

6274 search results - page 1173 / 1255
» From query complexity to computational complexity
Sort
View
TCS
2008
15 years 4 months ago
Competitive graph searches
We exemplify an optimization criterion for divide-and-conquer algorithms with a technique called generic competitive graph search. The technique is then applied to solve two probl...
Binh-Minh Bui-Xuan, Michel Habib, Christophe Paul
BMCBI
2005
94views more  BMCBI 2005»
15 years 4 months ago
Measuring similarities between transcription factor binding sites
Background: Collections of transcription factor binding profiles (Transfac, Jaspar) are essential to identify regulatory elements in DNA sequences. Subsets of highly similar profi...
Szymon M. Kielbasa, Didier Gonze, Hanspeter Herzel
BMCBI
2005
147views more  BMCBI 2005»
15 years 4 months ago
Calibration of mass spectrometric peptide mass fingerprint data without specific external or internal calibrants
Background: Peptide Mass Fingerprinting (PMF) is a widely used mass spectrometry (MS) method of analysis of proteins and peptides. It relies on the comparison between experimental...
Witold E. Wolski, Maciej Lalowski, Peter Jungblut,...
BMCBI
2005
122views more  BMCBI 2005»
15 years 4 months ago
A neural strategy for the inference of SH3 domain-peptide interaction specificity
Background: The SH3 domain family is one of the most representative and widely studied cases of so-called Peptide Recognition Modules (PRM). The polyproline II motif PxxP that gen...
Enrico Ferraro, Allegra Via, Gabriele Ausiello, Ma...
COGSCI
2002
103views more  COGSCI 2002»
15 years 3 months ago
Perceiving temporal regularity in music
We address how listeners perceive temporal regularity in music performances, which are rich in temporal irregularities. A computational model is described in which a small system ...
Edward W. Large, Caroline Palmer
« Prev « First page 1173 / 1255 Last » Next »