Sciweavers

148 search results - page 5 / 30
» Constructing Big Trees from Short Sequences
Sort
View
ICWSM
2009
14 years 10 months ago
From Episodes to Sagas: Understanding the News by Identifying Temporally Related Story Sequences
Current news interfaces are largely driven by recent information, even though many events are better interpreted in context of previous related events. To address this problem, we...
Ramnath Balasubramanyan, Frank Lin, William W. Coh...
NN
2006
Springer
15 years 10 days ago
Self-organizing neural networks to support the discovery of DNA-binding motifs
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from t...
Shaun Mahony, Panayiotis V. Benos, Terry J. Smith,...
TCC
2010
Springer
163views Cryptology» more  TCC 2010»
15 years 7 months ago
Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs
Introduced by Micali, Rabin and Kilian (MRK), the basic primitive of zero-knowledge sets (ZKS) allows a prover to commit to a secret set S so as to be able to prove statements such...
Benoît Libert, Moti Yung
BMCBI
2006
72views more  BMCBI 2006»
15 years 13 days ago
Selecting effective siRNA sequences by using radial basis function network and decision tree learning
Background: Although short interfering RNA (siRNA) has been widely used for studying gene functions in mammalian cells, its gene silencing efficacy varies markedly and there are o...
Shigeru Takasaki, Yoshihiro Kawamura, Akihiko Kona...
ICMLA
2007
15 years 1 months ago
Machine learned regression for abductive DNA sequencing
We construct machine learned regressors to predict the behaviour of DNA sequencing data from the fluorescent labelled Sanger method. These predictions are used to assess hypothes...
David Thornley, Maxim Zverev, Stavros Petridis