Sciweavers

1712 search results - page 4 / 343
» A Computational Approach to Binding Theory
Sort
View
WABI
2001
Springer
162views Bioinformatics» more  WABI 2001»
15 years 4 months ago
A Simple Hyper-Geometric Approach for Discovering Putative Transcription Factor Binding Sites
A central issue in molecular biology is understanding the regulatory mechanisms that control gene expression. The recent flood of genomic and postgenomic data opens the way for co...
Yoseph Barash, Gill Bejerano, Nir Friedman
ICFP
2001
ACM
15 years 11 months ago
Macros as Multi-Stage Computations: Type-Safe, Generative, Binding Macros in MacroML
With few exceptions, macros have traditionally been viewed as operations on syntax trees or even on plain strings. This view makes macros seem ad hoc, and is at odds with two desi...
Steven E. Ganz, Amr Sabry, Walid Taha
ICALP
2001
Springer
15 years 4 months ago
An Axiomatic Approach to Metareasoning on Nominal Algebras in HOAS
We present a logical framework Υ for reasoning on a very general class of languages featuring binding operators, called nominal , presented in higher-order abstract syntax (HOAS)....
Furio Honsell, Marino Miculan, Ivan Scagnetto
ISVC
2007
Springer
15 years 5 months ago
Integrative Geometric-Hashing Approaches to Binding Site Modeling and Ligand-Protein Interaction Prediction
Abstract. The function of a protein is dependent on whether and how it can interact with various ligands. Therefore, an accurate prediction of protein-ligand interactions is paramo...
Joanna Lipinski-Kruszka, Rahul Singh
CODES
2003
IEEE
15 years 5 months ago
A low power scheduler using game theory
In this paper, we describe a new methodology based on game theory for minimizing the average power of a circuit during scheduling in behavioral synthesis. The problem of schedulin...
N. Ranganathan, Ashok K. Murugavel