Sciweavers

39 search results - page 8 / 8
» DNA binding sites: representation and discovery
Sort
View
ML
1998
ACM
115views Machine Learning» more  ML 1998»
14 years 11 months ago
Pharmacophore Discovery Using the Inductive Logic Programming System PROGOL
This paper is a case study of a machine aided knowledge discovery process within the general area of drug design. More speci cally, the paper describes a sequence of experiments in...
Paul W. Finn, Stephen Muggleton, David Page, Ashwi...
ALMOB
2006
138views more  ALMOB 2006»
14 years 11 months ago
A combinatorial optimization approach for diverse motif finding applications
Background: Discovering approximately repeated patterns, or motifs, in biological sequences is an important and widely-studied problem in computational molecular biology. Most fre...
Elena Zaslavsky, Mona Singh
EVOW
2010
Springer
14 years 10 months ago
Finding Gapped Motifs by a Novel Evolutionary Algorithm
Background: Identifying approximately repeated patterns, or motifs, in DNA sequences from a set of co-regulated genes is an important step towards deciphering the complex gene reg...
Chengwei Lei, Jianhua Ruan
BMCBI
2010
123views more  BMCBI 2010»
14 years 6 months ago
Predicting conserved protein motifs with Sub-HMMs
Background: Profile HMMs (hidden Markov models) provide effective methods for modeling the conserved regions of protein families. A limitation of the resulting domain models is th...
Kevin Horan, Christian R. Shelton, Thomas Girke