<--- Back to Details
First PageDocument Content
Computational phylogenetics / Bioinformatics / Biology / Dynamic programming / Applied mathematics / Sequence alignment / Gap penalty / Levenshtein distance / Alignment / String searching algorithm / Multiple sequence alignment / NeedlemanWunsch algorithm
Date: 2016-03-20 22:29:46
Computational phylogenetics
Bioinformatics
Biology
Dynamic programming
Applied mathematics
Sequence alignment
Gap penalty
Levenshtein distance
Alignment
String searching algorithm
Multiple sequence alignment
NeedlemanWunsch algorithm

CSE 584A Class 15 Jeremy Buhler March 21, 2016 1

Add to Reading List

Source URL: classes.engineering.wustl.edu

Download Document from Source Website

File Size: 127,57 KB

Share Document on Facebook

Similar Documents

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem  Nabil Abdennadher

Towards a high level programming paradigm to deploy e-science applications with dynamic workflows on large scale distributed systems Mohamed Ben Belgacem Nabil Abdennadher

DocID: 1xTOs - View Document

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

Minimax Differential Dynamic Programming: An Application to Robust Biped Walking Jun Morimoto Human Information Science Labs, Department 3, ATR International

DocID: 1vqMk - View Document

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore   Rahul Jain*

Empirical Dynamic Programming William B. Haskell ISE Department, National University of Singapore Rahul Jain*

DocID: 1vouJ - View Document

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

MarchRevised MayReport LIDS-P-3506 Stable Optimal Control and Semicontractive Dynamic Programming

DocID: 1vhRF - View Document

EE365: Deterministic Finite State Control  Deterministic optimal control Shortest path problem Dynamic programming Examples

EE365: Deterministic Finite State Control Deterministic optimal control Shortest path problem Dynamic programming Examples

DocID: 1vg0M - View Document