Sciweavers

7047 search results - page 56 / 1410
» Focusing on Binding and Computation
Sort
View
IJBRA
2006
61views more  IJBRA 2006»
14 years 12 months ago
Finding functional promoter motifs by computational methods: a word of caution
: The standard practice in the analysis of promoters is to select promoter regions of convenient length. This may lead to false results when searching for Transcription Factor Bind...
Rajesh Chowdhary, Limsoon Wong, Vladimir B. Bajic
PERCOM
2007
ACM
15 years 11 months ago
Spray and Focus: Efficient Mobility-Assisted Routing for Heterogeneous and Correlated Mobility
Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are many real ...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
ACMICEC
2008
ACM
195views ECommerce» more  ACMICEC 2008»
15 years 1 months ago
DRM domain authentication using electronic payment systems
This paper focuses on the problem of how to allow sharing of copyrighted content between a set of authorised devices and preventing unauthoried copying of content to other devices...
Imad M. Abbadi, Muntaha Alawneh
ITP
2010
141views Mathematics» more  ITP 2010»
14 years 9 months ago
(Nominal) Unification by Recursive Descent with Triangular Substitutions
Using HOL4, we mechanise termination and correctness for two unification algorithms, written in a recursive descent style. One computes unifiers for first order terms, the other fo...
Ramana Kumar, Michael Norrish
RECOMB
2001
Springer
16 years 4 days ago
Context-specific Bayesian clustering for gene expression data
The recent growth in genomic data and measurements of genome-wide expression patterns allows us to apply computational tools to examine gene regulation by transcription factors. I...
Yoseph Barash, Nir Friedman