Sciweavers

3 search results - page 1 / 1
» Optimal Algorithm for Finding DNA Motifs with Nucleotide Adj...
Sort
View
APBC
2008
231views Bioinformatics» more  APBC 2008»
13 years 5 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...
TCBB
2008
103views more  TCBB 2008»
13 years 4 months ago
DNA Motif Representation with Nucleotide Dependency
The problem of discovering novel motifs of binding sites is important to the understanding of gene regulatory networks. Motifs are generally represented by matrices (PWM or PSSM) o...
Francis Y. L. Chin, Henry C. M. Leung
CSB
2003
IEEE
108views Bioinformatics» more  CSB 2003»
13 years 9 months ago
A Pattern Matching Algorithm for Codon Optimization and CpG Motif-Engineering in DNA Expression Vectors
Codon optimization enhances the efficiency of DNA expression vectors used in DNA vaccination and gene therapy by increasing protein expression. Additionally, certain nucleotide mo...
Ravi Vijaya Satya, Amar Mukherjee, Udaykumar Ranga