<--- 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

Multiple sequence alignment with user-defined constraints  

DocID: 1vdcP - View Document

Today’s Lecture • Multiple sequence alignment • Improved scoring of pairwise alignments – Affine gap penalties – Profiles

DocID: 1uPzd - View Document

Today’s Lecture • Finding multiple high-scoring segments • “D-segments” – relationship to 2-state HMMs • Sequence alignment & evolution

DocID: 1uG7I - View Document

Multiple Sequence Alignment: A Critical Comparison of Four Popular Programs Shirley Sutton, Biochemistry 218 Final Project, March 14, 2008 Introduction For both the computational biologist and the research biologist, the

DocID: 1uprj - View Document

Marina Sirota PROTEIN MULTIPLE ALIGNMENT MOTIVATION: To study evolution on the genetic level across a wide range of organisms, biologists need accurate tools for multiple sequence alignment of protein families. Given a

DocID: 1u67n - View Document