CS 591 is an advanced topics course in computational biology, focusing on two primary themes. The first is genome mapping via techniques of combinatorial (nonadaptive) group testing. The second is sequence alignment and related problems in phylogeny. The emphasis is placed on efficient solutions to these problems.

Students are expected to have background in data structures and in analysis and design of algorithms. Background in discrete mathematics, particularly combinatorics and graph theory, will be helpful but is not mandatory.

Course Information:	CSE 591:  Genomics: Sequencing and Mapping  http://enuxgs.eas.asu.edu/ccolbou/src/cse591f03.html
Class Meeting Time:	T Th 10:40-11:55  ECG 215
Instructor:    Office Hours:	Charlie Colbourn Office:  Goldwater 350  Charles.Colbourn@asu.edu TBA, by appointment (send email)
Prerequisites:	Data structures; Design and analysis of algorithms; Discrete mathematics
Special Needs:	If you are entitled to extra accommodation for any reason (such as a disability), we make every reasonable attempt to accommodate you. However, it is your responsibility to discuss this with the instructor at the beginning of the course.
Academic Honesty:	Work in this course, unless explicitly stated in writing to the contrary, is to be an effort by the individual student. It is not acceptable to use work other than your own without full attribution and acknowledgment. While you are welcome to discuss academic problems with others, it is not acceptable to discuss solutions with them. If in doubt about anything related to academic integrity, see the instructor.
TextBooks:
Required Text:	Dan Gusfield, "Algorithms on Strings, Trees, and Sequences", Cambridge University Press, 1997, ISBN 0 521 58519 8.
Recommended Text:	Ding-Zhu Du and Frank K. Hwang, "Combinatorial Group Testing and Its Applications" (Second Edition), World Scientific, 2000, ISBN 9810241070.