Sciweavers

388 search results - page 12 / 78
» Learning Methods for DNA Binding in Computational Biology
Sort
View
BMCBI
2006
145views more  BMCBI 2006»
14 years 9 months ago
Fast-Find: A novel computational approach to analyzing combinatorial motifs
Background: Many vital biological processes, including transcription and splicing, require a combination of short, degenerate sequence patterns, or motifs, adjacent to defined seq...
Micah Hamady, Erin Peden, Rob Knight, Ravinder Sin...
RECOMB
2005
Springer
15 years 10 months ago
Modeling the Combinatorial Functions of Multiple Transcription Factors
A considerable fraction of yeast gene promoters are bound by multiple transcription factors. To study the combinatorial interactions of multiple transcription factors is thus impor...
Chen-Hsiang Yeang, Tommi Jaakkola
RIVF
2008
14 years 11 months ago
Simple but effective methods for combining kernels in computational biology
Complex biological data generated from various experiments are stored in diverse data types in multiple datasets. By appropriately representing each biological dataset as a kernel ...
Hiroaki Tanabe, Tu Bao Ho, Canh Hao Nguyen, Saori ...
BIOINFORMATICS
2012
13 years 13 hour ago
Epigenetic priors for identifying active transcription factor binding sites
Motivation Accurate knowledge of the genome-wide binding of transcription factors in a particular cell type or under a particular condition is necessary for understanding transcri...
Gabriel Cuellar-Partida, Fabian A. Buske, Robert C...
ALMOB
2006
138views more  ALMOB 2006»
14 years 9 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh