Sciweavers

3378 search results - page 39 / 676
» A universe of binding and computation
Sort
View
75
Voted
BMCBI
2010
122views more  BMCBI 2010»
14 years 9 months ago
Simultaneous prediction of transcription factor binding sites in a group of prokaryotic genomes
Background: Our current understanding of transcription factor binding sites (TFBSs) in sequenced prokaryotic genomes is very limited due to the lack of an accurate and efficient c...
Shaoqiang Zhang, Shan Li, Phuc T. Pham, Zhengchang...
93
Voted
DAC
2004
ACM
15 years 10 months ago
Memory access scheduling and binding considering energy minimization in multi-bank memory systems
Memory-related activity is one of the major sources of energy consumption in embedded systems. Many types of memories used in embedded systems allow multiple operating modes (e.g....
Chun-Gi Lyuh, Taewhan Kim
PERCOM
2008
ACM
14 years 9 months ago
Composing software services in the pervasive computing environment: Languages or APIs?
The pervasive computing environment will be composed of heterogeneous services. In this work, we have explored how a domain specific language for service composition can be implem...
Jon Robinson, Ian Wakeman, Dan Chalmers
IJBRA
2006
61views more  IJBRA 2006»
14 years 9 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
89
Voted
ITP
2010
141views Mathematics» more  ITP 2010»
14 years 7 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