![Dynamic programming / Computational science / Sequence alignment / Smith–Waterman algorithm / Needleman–Wunsch algorithm / Multiple sequence alignment / Computational phylogenetics / Bioinformatics / Science Dynamic programming / Computational science / Sequence alignment / Smith–Waterman algorithm / Needleman–Wunsch algorithm / Multiple sequence alignment / Computational phylogenetics / Bioinformatics / Science](https://www.pdfsearch.io/img/3aa2312ec8c209d3e51308e8397de623.jpg) Date: 2007-10-05 18:42:44Dynamic programming Computational science Sequence alignment Smith–Waterman algorithm Needleman–Wunsch algorithm Multiple sequence alignment Computational phylogenetics Bioinformatics Science | | 1 Pairwise Global Alignment of Sequences Comparing sequences, structures (and sequences with structures) is the most fundamental operation in protein sequence and structure analysis. When a comparison indicates a similaAdd to Reading ListSource URL: media.wiley.comDownload Document from Source Website File Size: 147,59 KBShare Document on Facebook
|