Sciweavers

388 search results - page 26 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
RECOMB
2004
Springer
15 years 10 months ago
Finding approximate tandem repeats in genomic sequences
An efficient algorithm is presented for detecting approximate tandem repeats in genomic sequences. The algorithm is based on a flexible statistical model which allows a wide range...
Ydo Wexler, Zohar Yakhini, Yechezkel Kashi, Dan Ge...
BMCBI
2008
98views more  BMCBI 2008»
14 years 9 months ago
GBNet: Deciphering regulatory rules in the co-regulated genes using a Gibbs sampler enhanced Bayesian network approach
Background: Combinatorial regulation of transcription factors (TFs) is important in determining the complex gene expression patterns particularly in higher organisms. Deciphering ...
Li Shen, Jie Liu, Wei Wang
JCB
2008
90views more  JCB 2008»
14 years 9 months ago
A Simple Model of the Modular Structure of Transcriptional Regulation in Yeast
Resolving the general organizational principles that govern the interactions during transcriptional gene regulation has great relevance for understanding disease progression, biof...
Vladimir Filkov, Nameeta Shah
GCB
2010
Springer
204views Biometrics» more  GCB 2010»
14 years 7 months ago
Learning Pathway-based Decision Rules to Classify Microarray Cancer Samples
: Despite recent advances in DNA chip technology current microarray gene expression studies are still affected by high noise levels, small sample sizes and large numbers of uninfor...
Enrico Glaab, Jonathan M. Garibaldi, Natalio Krasn...
RECOMB
2001
Springer
15 years 10 months 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