RECOMB 2001 - PDF Preprint Papers

RECOMB 2001 Annual Conference on Research in Computational Molecular Biology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed RECOMB-2001 Paper

click to vote

RECOMB
2001
Springer

164views Computational Biology» more RECOMB 2001»

Finding motifs using random projections

14 years 11 months ago

Download www.cs.wisc.edu

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

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	164	Finding motifs using random projections	claim
2	164	Context-specific Bayesian clustering for gene expression data	claim
3	153	Algorithms for phylogenetic footprinting	claim
4	149	Geometric algorithms for the analysis of 2D-electrophoresis gels	claim
5	144	Applications of generalized pair hidden Markov models to alignment and gene finding problems	claim
6	136	101 optimal PDB structure alignments: a branch-and-cut algorithm for the maximum contact map overlap problem	claim
7	136	A new approach to fragment assembly in DNA sequencing	claim
8	133	Algorithms for identifying protein cross-links via tandem mass spectrometry	claim
9	133	Large scale sequencing by hybridization	claim
10	132	Comparing sequence scaffolds	claim
11	129	DNA segmentation as a model selection process	claim
12	129	Extracting structural information using time-frequency analysis of protein NMR data	claim
13	128	Class discovery in gene expression data	claim
14	126	Predicting the beta-helix fold from protein sequence data	claim
15	126	Analysis techniques for microarray time-series data	claim
16	124	The greedy path-merging algorithm for sequence assembly	claim
17	119	Edit distance between two RNA structures	claim
18	118	Using motion planning to study protein folding pathways	claim
19	113	A new approach to sequence comparison: normalized sequence alignment	claim
20	113	Gene functional classification from heterogeneous data	claim
21	110	Fast recovery of evolutionary trees with thousands of nodes	claim
22	110	Towards predicting coiled-coil protein interactions	claim
23	102	Gene-finding via tandem mass spectrometry	claim
24	95	A structural EM algorithm for phylogenetic inference	claim
25	94	Optimal sequencing by hybridization in rounds	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers