Sciweavers

659 search results - page 16 / 132
» Binding as sets of scopes
Sort
View
BMCBI
2005
104views more  BMCBI 2005»
15 years 7 days ago
Scoring functions for transcription factor binding site prediction
Background: Transcription factor binding site (TFBS) prediction is a difficult problem, which requires a good scoring function to discriminate between real binding sites and backg...
Markus T. Friberg, Peter von Rohr, Gaston H. Gonne...
ACL
1998
15 years 1 months ago
Semantic-Head Based Resolution of Scopal Ambiguities
We introduce an algorithm for scope resolution in underspecified semantic representations. Scope preferences are suggested on the basis of semantic argument structure. The major n...
Björn Gambäck, Johan Bos
101
Voted
FLOPS
2010
Springer
15 years 5 months ago
Tag-Free Combinators for Binding-Time Polymorphic Program Generation
Abstract. Binding-time polymorphism enables a highly flexible bindingtime analysis for offline partial evaluation. This work provides the tools to translate this flexibility into...
Peter Thiemann, Martin Sulzmann
101
Voted
RECOMB
2005
Springer
16 years 19 days ago
Predicting Transcription Factor Binding Sites Using Structural Knowledge
Abstract. Current approaches for identification and detection of transcription factor binding sites rely on an extensive set of known target genes. Here we describe a novel structu...
Tommy Kaplan, Nir Friedman, Hanah Margalit
PERCOM
2006
ACM
15 years 12 months ago
Composition Trust Bindings in Pervasive Computing Service Composition
In pervasive computing, devices or peers may implement or compose services using services from other devices or peers, and may use components from various sources. A composition t...
John Buford, Rakesh Kumar, Greg Perkins