Sciweavers

1712 search results - page 15 / 343
» A Computational Approach to Binding Theory
Sort
View
RECOMB
2001
Springer
16 years 2 days ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 5 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed
ACL
2004
15 years 1 months ago
Using Linguistic Principles to Recover Empty Categories
This paper describes an algorithm for detecting empty nodes in the Penn Treebank (Marcus et al., 1993), finding their antecedents, and assigning them function tags, without access...
Richard Campbell
FPL
2000
Springer
93views Hardware» more  FPL 2000»
15 years 3 months ago
Reconfigurable Computing between Classifications and Metrics - The Approach of Space/Time-Scheduling
Abstract. Reconfigurable computing receives its merits from scheduling timebased into space-based execution. This paper reviews some common parameters and introduces an additional ...
Christian Siemers
BMCBI
2002
128views more  BMCBI 2002»
14 years 11 months ago
Correlating overrepresented upstream motifs to gene expression: a computational approach to regulatory element discovery in euka
Background: Gene regulation in eukaryotes is mainly effected through transcription factors binding to rather short recognition motifs generally located upstream of the coding regi...
Michele Caselle, Ferdinando Di Cunto, Paolo Prover...