Skip to content
#

pairs

Here are 52 public repositories matching this topic...

In this assignment, we will look at an application of Dynamic Programming to align DNA sequences. In the global DNA sequence alignment problem, you are given as input two DNA sequences S1, S2, which are strings using the four characters A, C, T, G. The strings are of lengths m, n, where possibly m not equal n. Given two DNA sequences, the goal is to compute the best possible (minimum) alignment cost between them. We will soon specify how to compute the alignment cost between two sequences.

  • Updated Jan 1, 2021
  • C++

Improve this page

Add a description, image, and links to the pairs topic page so that developers can more easily learn about it.

Curate this topic

Add this topic to your repo

To associate your repository with the pairs topic, visit your repo's landing page and select "manage topics."

Learn more