Sciweavers

6 search results - page 1 / 2
» Unconditional exact tests for the difference of binomial pro...
Sort
View
BMCBI
2007
125views more  BMCBI 2007»
13 years 7 months ago
Statistical tests to compare motif count exceptionalities
Background: Finding over- or under-represented motifs in biological sequences is now a common task in genomics. Thanks to p-value calculation for motif counts, exceptional motifs ...
Stéphane Robin, Sophie Schbath, Vincent Van...
BMCBI
2010
124views more  BMCBI 2010»
13 years 7 months ago
Estimation and efficient computation of the true probability of recurrence of short linear protein sequence motifs in unrelated
Background: Large datasets of protein interactions provide a rich resource for the discovery of Short Linear Motifs (SLiMs) that recur in unrelated proteins. However, existing met...
Norman E. Davey, Richard J. Edwards, Denis C. Shie...
TVLSI
2008
107views more  TVLSI 2008»
13 years 7 months ago
Novel Probabilistic Combinational Equivalence Checking
Exact approaches to combinational equivalence checking, such as automatic test pattern generation-based, binary decision diagrams (BDD)-based, satisfiability-based, and hybrid appr...
Shih-Chieh Wu, Chun-Yao Wang, Yung-Chih Chen
PRL
2008
85views more  PRL 2008»
13 years 7 months ago
Reliability estimation of a statistical classifier
Pattern classification techniques derived from statistical principles have been widely studied and have proven powerful in addressing practical classification problems. In real-wo...
Pandu Ranga Rao Devarakota, Bruno Mirbach, Bjö...
ICPR
2006
IEEE
14 years 8 months ago
Competitive Mixtures of Simple Neurons
We propose a competitive finite mixture of neurons (or perceptrons) for solving binary classification problems. Our classifier includes a prior for the weights between different n...
Karthik Sridharan, Matthew J. Beal, Venu Govindara...