388 search results - page 55 / 78 » Learning Methods for DNA Binding in Computational Biology |
86
Voted
GECCO
2006
Springer
15 years 1 months ago
2006
Springer
The pharmaceutical industry is facing an ever-increasing demand to discover novel drugs that are more effective and safer than existing ones. The industry faces huge problem in im...
GECCO
2008
Springer
14 years 10 months ago
2008
Springer
A genetic algorithm (GA) is utilised to discover known and novel PROSITE-like sequence templates that can be used to classify the sub-cellular location of eukaryotic proteins. Whi...
89
Voted
BMCBI
2006
14 years 9 months ago
2006
Background: The problem of inferring the evolutionary history and constructing the phylogenetic tree with high performance has become one of the major problems in computational bi...
ALMOB
2008
14 years 9 months ago
2008
Background: MicroRNAs (miRs) are small noncoding RNAs that bind to complementary/partially complementary sites in the 3' untranslated regions of target genes to regulate prot...
71
Voted
ICML
2010
IEEE
14 years 10 months ago
2010
IEEE
We develop a penalized kernel smoothing method for the problem of selecting nonzero elements of the conditional precision matrix, known as conditional covariance selection. This p...