In the previous lecture we have seen the principle behind dynamic programming. This approach is extremely useful for comparing biological sequences, which is coincidentally one of the main points of this course. This lecture explain how this is done. In writing this text I heavily relied on wonderful course taught by Ben Langmead at Johns Hopkins. The cover image shows pairwise alignments for human, mouse, and dog KIF3 locus from Dubchak et al. 2000. How different are two sequences? Suppose you have two sequences of the same length: A C A T G C C T A A C T G C C T A C How different are they? In other words, how many bases should be change to turn one sequence onto the other: A C A T G C C T A
Feb 18, 2025Introduction to Data Driven Life Sciences | Spring 2023
Feb 3, 2025Colors
Mar 22, 2024Quiz Prep Go to https://colab.research.google.com Log in with your PSU account and create a new notebook Complete the quiz Share you notebook with aun1@psu.edu. Make sure you set me as an editor: Questions Question 1 (50 pts) Using a for loop write code that will calculate the sum of the numbers 1 through 100.
Feb 13, 2024or
By clicking below, you agree to our terms of service.
New to HackMD? Sign up