<--- Back to Details
First PageDocument Content
STING / Sequence alignment / Sequence logo / Substitution matrix / Multiple sequence alignment / Entropy / BLOSUM / Sequence motif / BLAST / Bioinformatics / Science / Biology
Date: 2006-09-25 04:26:20
STING
Sequence alignment
Sequence logo
Substitution matrix
Multiple sequence alignment
Entropy
BLOSUM
Sequence motif
BLAST
Bioinformatics
Science
Biology

BMC Bioinformatics BioMed Central Open Access

Add to Reading List

Source URL: www.ram.org

Download Document from Source Website

File Size: 1,25 MB

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”

DocID: 1uPSR - View Document

Statistics / Probability / Machine learning / Markov models / Statistical models / Bioinformatics / Estimation theory / Graph theory / Markov chain / Dynamic programming / Bayesian network / Sequence motif

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

DocID: 1qFGd - View Document

Bioinformatics / Biology / Computational phylogenetics / Genetics / Sequence alignment / Multiple sequence alignment / Sequence analysis / Nucleic acid sequence / Dynamic programming / Phylo / Sequence motif / Nucleic acid structure prediction

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

DocID: 1q7MX - View Document

Bioinformatics / Applied mathematics / Multiple sequence alignment / Pattern recognition / NC / Learning / Expectationmaximization algorithm / Artificial intelligence / Planted motif search

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

DocID: 1pTaC - View Document

Bioinformatics / Sequence motif / DNA binding site / Algorithm / Motif / Multiple sequence alignment / Teiresias algorithm / NP / Planted motif search / Multiple EM for Motif Elicitation

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

DocID: 1pE3O - View Document