Sciweavers

60 search results - page 5 / 12
» Finding motifs from all sequences with and without binding s...
Sort
View
APBC
2008
231views Bioinformatics» more  APBC 2008»
14 years 11 months ago
Optimal Algorithm for Finding DNA Motifs with Nucleotide Adjacent Dependency
: Finding motifs and the corresponding binding sites is a critical and challenging problem in studying the process of gene expression. String and matrix representations are two pop...
Francis Y. L. Chin, Henry C. M. Leung, Man-Hung Si...
75
Voted
PSB
2004
14 years 11 months ago
Phylogenetic Motif Detection by Expectation-Maximization on Evolutionary Mixtures
ct The preferential conservation of transcription factor binding sites implies that non-coding sequence data from related species will prove a powerful asset to motif discovery. We...
Alan M. Moses, Derek Y. Chiang, Michael B. Eisen
BMCBI
2007
148views more  BMCBI 2007»
14 years 9 months ago
fREDUCE: Detection of degenerate regulatory elements using correlation with expression
Background: The precision of transcriptional regulation is made possible by the specificity of physical interactions between transcription factors and their cognate binding sites ...
Randy Z. Wu, Christina Chaivorapol, Jiashun Zheng,...
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...
75
Voted
GECCO
2005
Springer
140views Optimization» more  GECCO 2005»
15 years 3 months ago
MDGA: motif discovery using a genetic algorithm
Computationally identifying transcription factor binding sites in the promoter regions of genes is an important problem in computational biology and has been under intensive resea...
Dongsheng Che, Yinglei Song, Khaled Rasheed