1793 search results - page 18 / 359 » On the Design of Codes for DNA Computing |
110
click to vote
BMCBI
2010
14 years 12 months ago
2010
Background: To further understand the implementation of hyperparameters re-estimation technique in Bayesian hierarchical model, we added two more prior assumptions over the weight...
BMCBI
2008
14 years 12 months ago
2008
Background: DNA microarrays contain thousands of different probe sequences represented on their surface. These are designed in such a way that potential cross-hybridization reacti...
106
click to vote
TCBB
2008
14 years 11 months ago
2008
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...
103
click to vote
BMCBI
2010
2010
An intuitionistic approach to scoring DNA sequences against transcription factor binding site motifs
14 years 12 months ago
Background: Transcription factors (TFs) control transcription by binding to specific regions of DNA called transcription factor binding sites (TFBSs). The identification of TFBSs ...
107
Voted
IPPS
2007
IEEE
15 years 6 months ago
2007
IEEE
DNA sequence alignment is a very important problem in bioinformatics. The algorithm proposed by Smith-Waterman (SW) is an exact method that obtains optimal local alignments in qua...