Sciweavers

41 search results - page 2 / 9
» Finding motifs using random projections
Sort
View
BMCBI
2007
148views more  BMCBI 2007»
13 years 5 months ago
WeederH: an algorithm for finding conserved regulatory motifs and regions in homologous sequences
Background: This work addresses the problem of detecting conserved transcription factor binding sites and in general regulatory regions through the analysis of sequences from homo...
Giulio Pavesi, Federico Zambelli, Graziano Pesole
NAR
2008
119views more  NAR 2008»
13 years 5 months ago
MALISAM: a database of structurally analogous motifs in proteins
MALISAM (manual alignments for structurally analogous motifs) represents the first database containing pairs of structural analogs and their alignments. To find reliable analogs, ...
Hua Cheng, Bong-Hyun Kim, Nick V. Grishin
ICML
2010
IEEE
13 years 6 months ago
Learning Markov Logic Networks Using Structural Motifs
Markov logic networks (MLNs) use firstorder formulas to define features of Markov networks. Current MLN structure learners can only learn short clauses (4-5 literals) due to extre...
Stanley Kok, Pedro Domingos
KDD
2003
ACM
127views Data Mining» more  KDD 2003»
14 years 5 months ago
Experiments with random projections for machine learning
Dimensionality reduction via Random Projections has attracted considerable attention in recent years. The approach has interesting theoretical underpinnings and offers computation...
Dmitriy Fradkin, David Madigan
ICASSP
2008
IEEE
13 years 11 months ago
Finding needles in noisy haystacks
The theory of compressed sensing shows that samples in the form of random projections are optimal for recovering sparse signals in high-dimensional spaces (i.e., finding needles ...
Rui M. Castro, Jarvis Haupt, Robert Nowak, Gil M. ...