<--- Back to Details
First PageDocument Content
Bioinformatics / Gene expression / Transcription factors / Consensus sequence / Sequence motif / Multiple EM for Motif Elicitation / Biology / DNA / Genetics
Date: 2004-02-23 14:39:16
Bioinformatics
Gene expression
Transcription factors
Consensus sequence
Sequence motif
Multiple EM for Motif Elicitation
Biology
DNA
Genetics

NEGATIVE INFORMATION FOR MOTIF DISCOVERY K. T. TAKUSAGAWA D. K. GIFFORD [removed] giff[removed] Computer Science and Artificial Intelligence Laboratory

Add to Reading List

Source URL: www.psrg.lcs.mit.edu

Download Document from Source Website

File Size: 107,45 KB

Share Document on Facebook

Similar Documents

Today’s Lecture • Dynamic programming to find highest weight paths • Weighted linked lists – Sequence graphs – WLLs for “motif clusters”

Today’s Lecture • Dynamic programming to find highest weight paths • Weighted linked lists – Sequence graphs – WLLs for “motif clusters”

DocID: 1uPSR - View Document

Vol. 24 ECCB 2008, pages i160–i166 doi:bioinformatics/btn282 BIOINFORMATICS  Efficient representation and P-value computation for

Vol. 24 ECCB 2008, pages i160–i166 doi:bioinformatics/btn282 BIOINFORMATICS Efficient representation and P-value computation for

DocID: 1qFGd - View Document

Genome Informatics 12: 184–A Mini-Greedy Algorithm for Faster Structural RNA Stem-Loop Search

Genome Informatics 12: 184–A Mini-Greedy Algorithm for Faster Structural RNA Stem-Loop Search

DocID: 1q7MX - View Document

Vol. 18 noPages 1374–1381 BIOINFORMATICS Finding motifs in the twilight zone U. Keich ∗ and P. A. Pevzner

Vol. 18 noPages 1374–1381 BIOINFORMATICS Finding motifs in the twilight zone U. Keich ∗ and P. A. Pevzner

DocID: 1pTaC - View Document

Genome Informatics 15(2): 63–An Extension and Novel Solution to the (l,d )–Motif Challenge Problem

Genome Informatics 15(2): 63–An Extension and Novel Solution to the (l,d )–Motif Challenge Problem

DocID: 1pE3O - View Document