Sciweavers

388 search results - page 7 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
BMCBI
2008
259views more  BMCBI 2008»
13 years 7 months ago
DISCLOSE : DISsection of CLusters Obtained by SEries of transcriptome data using functional annotations and putative transcripti
Background: A typical step in the analysis of gene expression data is the determination of clusters of genes that exhibit similar expression patterns. Researchers are confronted w...
Evert-Jan Blom, Sacha A. F. T. van Hijum, Klaas J....
CSB
2003
IEEE
153views Bioinformatics» more  CSB 2003»
14 years 21 days ago
Combining Microarrays and Biological Knowledge for Estimating Gene Networks via Bayesian Networks
We propose a statistical method for estimating a gene network based on Bayesian networks from microarray gene expression data together with biological knowledge including protein-...
Seiya Imoto, Tomoyuki Higuchi, Takao Goto, Kousuke...
BMCBI
2007
179views more  BMCBI 2007»
13 years 7 months ago
rMotifGen: random motif generator for DNA and protein sequences
Background: Detection of short, subtle conserved motif regions within a set of related DNA or amino acid sequences can lead to discoveries about important regulatory domains such ...
Eric C. Rouchka, C. Timothy Hardin
NN
2006
Springer
13 years 7 months ago
Self-organizing neural networks to support the discovery of DNA-binding motifs
Identification of the short DNA sequence motifs that serve as binding targets for transcription factors is an important challenge in bioinformatics. Unsupervised techniques from t...
Shaun Mahony, Panayiotis V. Benos, Terry J. Smith,...
BMCBI
2010
113views more  BMCBI 2010»
13 years 7 months ago
Unifying generative and discriminative learning principles
Background: The recognition of functional binding sites in genomic DNA remains one of the fundamental challenges of genome research. During the last decades, a plethora of differe...
Jens Keilwagen, Jan Grau, Stefan Posch, Marc Stric...