APS Excellence in Physics Education Award
November 2019

Education Prize Logo
Science SPORE Prize
November 2011

NSF Logo
The Open Source Physics Project is supported by NSF DUE-0442581.

Longest Common DNA Subsequence Model Documents

This material has 2 associated documents. Select a document title to view a document's information.

Main Document

Longest Common DNA Subsequence Model 

written by Tyler Murray

The Longest Common DNA Subsequence Model implements a widely used method for DNA comparison by searching two DNA sequences for matching subsequences.  The more two DNA sequences have in common, the more likely they are to have similar functionality.  The simulation draws a grid whose components are described by nucleotides in each DNA sequence.   The algorithm moves through the grid and weighs each component based on the agreement between the two nucleotides.  Components with matching nucleotides are weighed heavier than those whose nucleotides don't match.  Then the algorithm moves through the grid again and finds the heaviest weighted path.  This path results in the longest common sub-sequence. 

The Longest Common DNA Subsequence Model  is distributed as a ready-to-run (compiled) Java archive.   Double clicking the jar file will run the program if Java is installed.  You can modify this simulation if you have EJS installed by right-clicking within the map and selecting "Open Ejs Model" from the pop-up menu item.

Published November 17, 2014
Last Modified November 18, 2014

This file has previous versions.

Source Code Documents

Longest Common DNA Subsequence Source Code 

The source code zip archive contains an XML representation of the Longest Common DNA Subsequence Model.   Unzip this archive in your EjsS workspace to compile and run this model using EjsS.

Last Modified November 18, 2014

OSP Projects:
Open Source Physics - EJS Modeling
Physlet Physics
Physlet Quantum Physics
STP Book