Sciweavers

2192 search results - page 4 / 439
» Algorithms for Challenging Motif Problems
Sort
View
APBC
2008
231views Bioinformatics» more  APBC 2008»
13 years 9 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...
GECCO
2007
Springer
258views Optimization» more  GECCO 2007»
13 years 11 months ago
TFBS identification by position- and consensus-led genetic algorithm with local filtering
Identification of Transcription Factor Binding Site (TFBS) motifs in multiple DNA upstream sequences is important in understanding the mechanism of gene regulation. This identific...
Tak-Ming Chan, Kwong-Sak Leung, Kin-Hong Lee
BMCBI
2010
134views more  BMCBI 2010»
13 years 8 months ago
BayesMotif: de novo protein sorting motif discovery from impure datasets
Background: Protein sorting is the process that newly synthesized proteins are transported to their target locations within or outside of the cell. This process is precisely regul...
Jianjun Hu, Fan Zhang
BIBM
2009
IEEE
156views Bioinformatics» more  BIBM 2009»
14 years 1 months ago
Bayesian Classifier for Anchored Protein Sorting Discovery
—A typical cell has a size of only 10 µm while it contains about a billion proteins. Transportation of these proteins from their synthesis sites to their target locations within...
Fan Zhang, Jianjun Hu
CSB
2003
IEEE
14 years 1 months ago
LOGOS: a modular Bayesian model for de novo motif detection
The complexity of the global organization and internal structures of motifs in higher eukaryotic organisms raises significant challenges for motif detection techniques. To achiev...
Eric P. Xing, Wei Wu, Michael I. Jordan, Richard M...