Prerequisites: CS 141 or CS 218; graduate standing
Description: A study of fundamental algorithms for solving combinatorial or computational problems in molecular biology and genomics. Includes sequence alignment and multiple alignment; bio-database search; gene and regulatory signal recognition; DNA sequence assembly; physical mapping; and reconstruction of evolutionary trees.
Credit: May be taken Satisfactory (S) or No Credit (NC) with consent of instructor and graduate advisor. Credit is awarded for one of the following CS 238 or CS 144.