<--- Back to Details
| First Page | Document Content | |
|---|---|---|
 Date: 2002-01-17 03:51:05Bioinformatics Biology Computational phylogenetics Genetics Sequence alignment Multiple sequence alignment Sequence analysis Nucleic acid sequence Dynamic programming Phylo Sequence motif Nucleic acid structure prediction |
Add to Reading List |
Genome Informatics 12: 184–A Mini-Greedy Algorithm for Faster Structural RNA Stem-Loop Search | 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 forDocID: 1qFGd - View Document |
| Genome Informatics 12: 184–A Mini-Greedy Algorithm for Faster Structural RNA Stem-Loop SearchDocID: 1q7MX - View Document |
 | Vol. 18 noPages 1374–1381 BIOINFORMATICS Finding motifs in the twilight zone U. Keich ∗ and P. A. PevznerDocID: 1pTaC - View Document |
 | Genome Informatics 15(2): 63–An Extension and Novel Solution to the (l,d )–Motif Challenge ProblemDocID: 1pE3O - View Document |