Support

Support Options

  • Knowledge Base

    Find information on common questions and issues.

  • Support Messages

    Check on the status of your correspondences with members of the QUBES team.

Contact Us

About you
About the problem

Needleman - Wunsch Algorithm Exercise

By Michael Sierk1, Sam S Donovan2, Neal Grandgenett, Bill Morgan3, Mark A. Pauley4, Elizabeth F Ryder5

1. Saint Vincent College 2. University of Pittsburgh 3. The College of Wooster 4. University of Nebraska at Omaha 5. Worcester Polytechnic Institute

This exercise is used in a sophomore-junior level bioinformatics course. The algorithm is introduced to the students who then complete the exercise.

Listed in Teaching Materials | resource by group NIBLSE Incubator: Needleman-Wunsch Algorithm Exercise

Version 4.0 - published on 22 Apr 2020 doi:10.25334/H7KQ-F202 - cite this

Licensed under CC Attribution-ShareAlike 4.0 International according to these terms

Sierk-001-image.png

Description

This exercise is used in a sophomore-junior level bioinformatics course. The algorithm is introduced to the students who then spend around 15 minutes filling out the diagram. Students have typically been doing some sequence alignment exercises, such as BLAST searches, and have used different scoring systems to score different short alignments, so they are familiar with sequence alignments and the concept of scoring the alignments, but they have not been exposed to how to generate an alignment. 

Content List

Cite this work

Researchers should cite this work as follows:

Tags

Notes

The publication was updated to include the most recent materials and authorship list. 

NIBLSE Incubator: Needleman-Wunsch Algorithm Exercise

NIBLSE Incubator: Needleman-Wunsch Algorithm Exercise group image

When watching a resource, you will be notified when a new version is released.