Sciweavers

2192 search results - page 14 / 439
» Algorithms for Challenging Motif Problems
Sort
View
BMCBI
2008
144views more  BMCBI 2008»
13 years 8 months ago
Pep-3D-Search: a method for B-cell epitope prediction based on mimotope analysis
Background: The prediction of conformational B-cell epitopes is one of the most important goals in immunoinformatics. The solution to this problem, even if approximate, would help...
Yanxin Huang, Yongli Bao, Shu Yan Guo, Yan Wang, C...
ISMB
2000
13 years 9 months ago
A Statistical Method for Finding Transcription Factor Binding Sites
Understanding the mechanismsthat determine the regulation of geneexpression is an important and challenging problem. A fundamental subproblem is to identify DNA-bindingsites for u...
Saurabh Sinha, Martin Tompa
BMCBI
2007
148views more  BMCBI 2007»
13 years 8 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,...
BIRD
2008
Springer
177views Bioinformatics» more  BIRD 2008»
13 years 10 months ago
Fast Structured Motif Search in DNA Sequences
We study the problem of structured motif search in DNA sequences. This is a fundamental task in bioinformatics which contributes to better understanding of genome characteristics a...
Mihail Halachev, Nematollaah Shiri
BMCBI
2010
108views more  BMCBI 2010»
13 years 8 months ago
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
Fernando Garcia-Alcalde, Armando Blanco, Adrian J....