Sciweavers

16430 search results - page 124 / 3286
» On Computable Tree Functions
Sort
View
147
Voted
BMCBI
2004
207views more  BMCBI 2004»
15 years 3 months ago
Computational identification of transcription factor binding sites by functional analysis of sets of genes sharing overrep-resen
Background: Transcriptional regulation is a key mechanism in the functioning of the cell, and is mostly effected through transcription factors binding to specific recognition moti...
Davide Corà, Ferdinando Di Cunto, Paolo Pro...
144
Voted
STACS
2012
Springer
13 years 11 months ago
The Denjoy alternative for computable functions
The Denjoy-Young-Saks Theorem from classical analysis states that for an arbitrary function f : R → R, the Denjoy alternative holds outside a null set, i.e., for almost every re...
Laurent Bienvenu, Rupert Hölzl, Joseph S. Mil...
118
Voted
BMCBI
2006
109views more  BMCBI 2006»
15 years 3 months ago
A computational approach to discovering the functions of bacterial phytochromes by analysis of homolog distributions
Background: Phytochromes are photoreceptors, discovered in plants, that control a wide variety of developmental processes. They have also been found in bacteria and fungi, but for...
Tilman Lamparter
125
Voted
COMPSAC
2008
IEEE
15 years 10 months ago
Utilising Located Functions to Model and Optimise Distributed Computations
With developments in Grid computing and Web based data storage the task of orchestrating computations is becoming ever more difficult. Identifying which of the available computati...
Stephen Crouch, Peter Henderson, Robert John Walte...
SP
2003
IEEE
15 years 8 months ago
Hardening Functions for Large Scale Distributed Computations
Many recent large-scale distributed computing applications utilize spare processor cycles of personal computers that are connected to the Internet. The resulting distributed compu...
Doug Szajda, Barry G. Lawson, Jason Owen