388 search results - page 10 / 78 » Learning Methods for DNA Binding in Computational Biology |
ISMB
1994
14 years 11 months ago
1994
Weuse a quantitative definition of specificity to developa neural networkfor the identification of commonprotein binding sites in a collection of unaligned DNAfragments. Wedemonst...
101
click to vote
CSB
2003
IEEE
15 years 2 months ago
2003
IEEE
Regulatory sequence elements provide important clues to understanding and predicting gene expression. Although the binding sites for hundreds of transcription factors are known, t...
104
Voted
EC
1998
14 years 9 months ago
1998
L. M. Adleman launched the field of DNA computing with a demonstration in 1994 that strands of DNA could be used to solve the Hamiltonian path problem for a simple graph. He also...
95
Voted
IPPS
2007
IEEE
15 years 3 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...
ICMLA
2007
14 years 11 months ago
2007
We describe SVMotif, a support vector machine-based learning algorithm for identification of cellular DNA transcription factor (TF) motifs extrapolated from known TF-gene interact...