Sciweavers

35 search results - page 2 / 7
» A Combined Model and a Varied Gibbs Sampling Algorithm Used ...
Sort
View
GECCO
2004
Springer
131views Optimization» more  GECCO 2004»
13 years 11 months ago
PolyEDA: Combining Estimation of Distribution Algorithms and Linear Inequality Constraints
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
Jörn Grahl, Franz Rothlauf
RECOMB
2008
Springer
14 years 5 months ago
A Fast, Alignment-Free, Conservation-Based Method for Transcription Factor Binding Site Discovery
As an increasing number of eukaryotic genomes are being sequenced, comparative studies aimed at detecting regulatory elements in intergenic sequences are becoming more prevalent. M...
Raluca Gordân, Leelavati Narlikar, Alexander...
RECOMB
2007
Springer
13 years 11 months ago
Nucleosome Occupancy Information Improves de novo Motif Discovery
A complete understanding of transcriptional regulatory processes in the cell requires identification of transcription factor binding sites on a genomewide scale. Unfortunately, th...
Leelavati Narlikar, Raluca Gordân, Alexander...
JCB
2008
159views more  JCB 2008»
13 years 5 months ago
BayesMD: Flexible Biological Modeling for Motif Discovery
We present BayesMD, a Bayesian Motif Discovery model with several new features. Three different types of biological a priori knowledge are built into the framework in a modular fa...
Man-Hung Eric Tang, Anders Krogh, Ole Winther
ALMOB
2006
155views more  ALMOB 2006»
13 years 5 months ago
Refining motifs by improving information content scores using neighborhood profile search
The main goal of the motif finding problem is to detect novel, over-represented unknown signals in a set of sequences (e.g. transcription factor binding sites in a genome). The mo...
Chandan K. Reddy, Yao-Chung Weng, Hsiao-Dong Chian...