Sciweavers

185
Voted
RECOMB
2001
Springer
16 years 3 months ago
Finding motifs using random projections
motif discovery problem abstracts the task of discovering short, conserved sites in genomic DNA. Pevzner and Sze recently described a precise combinatorial formulation of motif di...
Jeremy Buhler, Martin Tompa
141
Voted
RECOMB
2001
Springer
16 years 3 months ago
Context-specific Bayesian clustering for gene expression data
The recent growth in genomic data and measurements of genome-wide expression patterns allows us to apply computational tools to examine gene regulation by transcription factors. I...
Yoseph Barash, Nir Friedman
90
Voted
RECOMB
2001
Springer
16 years 3 months ago
Algorithms for phylogenetic footprinting
Phylogenetic footprinting is a comparative genomics approach for predicting transcription factor binding sites, where a set of orthologous regulatory regions are compared and short...
Mathieu Blanchette
RECOMB
2001
Springer
16 years 3 months ago
Geometric algorithms for the analysis of 2D-electrophoresis gels
In proteomics 2?dimensional gel electrophoresis (2?DE) is a separation technique for proteins. The resulting protein spots can be identified by either using picking robots and sub...
Alon Efrat, Frank Hoffmann, Klaus Kriegel, Christo...
111
Voted
RECOMB
2001
Springer
16 years 3 months ago
Applications of generalized pair hidden Markov models to alignment and gene finding problems
Hidden Markov models (HMMs) have been successfully applied to a variety of problems in molecular biology, ranging from alignment problems to gene nding and annotation. Alignment p...
Lior Pachter, Marina Alexandersson, Simon Cawley
Computational Biology
Top of PageReset Settings