Sciweavers

736 search results - page 5 / 148
» Approximating the Number of Network Motifs
Sort
View
AIA
2007
13 years 8 months ago
Optimizing number of hidden neurons in neural networks
In this paper, a novel and effective criterion based on the estimation of the signal-to-noise-ratio figure (SNRF) is proposed to optimize the number of hidden neurons in neural ne...
Yue Liu, Janusz A. Starzyk, Zhen Zhu
BMCBI
2006
136views more  BMCBI 2006»
13 years 7 months ago
EMD: an ensemble algorithm for discovering regulatory motifs in DNA sequences
Background: Understanding gene regulatory networks has become one of the central research problems in bioinformatics. More than thirty algorithms have been proposed to identify DN...
Jianjun Hu, Yifeng D. Yang, Daisuke Kihara
EVOW
2010
Springer
13 years 6 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
BMCBI
2006
113views more  BMCBI 2006»
13 years 7 months ago
GibbsST: a Gibbs sampling method for motif discovery with enhanced resistance to local optima
Background: Computational discovery of transcription factor binding sites (TFBS) is a challenging but important problem of bioinformatics. In this study, improvement of a Gibbs sa...
Kazuhito Shida
BMCBI
2004
207views more  BMCBI 2004»
13 years 7 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...