Ã山ǿ¼é

Minor Computational Molecular Biology (24 credits)

Note: This is the 2010–2011 edition of the eCalendar. Update the year in your browser's URL bar for the most recent version of this page, or click here to jump to the newest eCalendar.

Offered by: Computer Science     Degree: Bachelor of Science

Program Requirements

Computational molecular biology is the sub-discipline of bioinformatics that is located at the intersection of computer science and molecular biology. The focus of this area is on techniques for managing and analyzing molecular sequence data. This program will provide undergraduate students in the biological sciences with the skills from computer science to solve computational problems arising in molecular biology and genomics and will provide students with the necessary skills to build software tools from these algorithms.

The Minor Computational Molecular Biology is NOT open to students in Computer Science or Joint Computer Science programs.

Required Courses (24 credits)

  • COMP 202 Introduction to Computing 1 (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Overview of components of microcomputers, the internet design and implementation of programs using a modern high-level language, an introduction to modular software design and debugging. Programming concepts are illustrated using a variety of application areas.

    Terms: Fall 2010, Winter 2011, Summer 2011

    Instructors: Petitpas, Mathieu; Frydrychowicz, Maja (Fall) Frydrychowicz, Maja; Pomerantz, Daniel (Winter) Pomerantz, Daniel (Summer)

    • 3 hours
    • Prerequisite: a CEGEP level mathematics course
    • Restrictions: COMP 202 and COMP 208 cannot both be taken for credit. COMP 202 is intended as a general introductory course, while COMP 208 is intended for students interested in scientific computation. COMP 202 cannot be taken for credit with or after COMP 250
  • COMP 203 Introduction to Computing 2 (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Basic data structures. Representation of arrays, stacks, and queues. Linked lists and their applications to binary trees. Internal sorting. Graph representation. Elementary graph algorithms.

    Terms: This course is not scheduled for the 2010-2011 academic year.

    Instructors: There are no professors associated with this course for the 2010-2011 academic year.

    • 3 hours
    • Prerequisites: MATH 133 and COMP 202
    • Restrictions: COMP 203 and COMP 250 are considered to be equivalent from a prerequisite point of view, and cannot both be taken for credit. Students who are registered in the following programs: Major or Honours in Computer Science, Major in Software Engineering, any of the joint major programs offered through the Faculty of Science and the Major Concentration in Foundations of Computing, in the Faculty of Arts, may not take this course.
  • COMP 251 Data Structures and Algorithms (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Design and analysis of algorithms. Complexity of algorithms. Data structures. Introduction to graph algorithms and their analysis.

    Terms: Fall 2010, Winter 2011

    Instructors: Verbrugge, Clark (Fall) Crepeau, Claude (Winter)

    • 3 hours
    • Prerequisite: COMP 250 or COMP 203.
    • Restrictions: Not open to students who have taken or are taking COMP 252.
  • COMP 360 Algorithm Design Techniques (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : A study of techniques for the design and analysis of algorithms.

    Terms: Fall 2010, Winter 2011

    Instructors: Vetta, Adrian Roshan (Fall) Nguyen, The Phuong (Winter)

    • 3 hours
    • Prerequisite: Either COMP 251 or COMP 252, and either MATH 240 or MATH 235 or MATH 363.
    • Restriction: Not open to students who have taken or are taking COMP 362.
  • COMP 462 Computational Biology Methods (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Application of computer science techniques to problems arising in biology and medicine, techniques for modeling evolution, aligning molecular sequences, predicting structure of a molecule and other problems from computational biology.

    Terms: Fall 2010

    Instructors: Waldispuhl, Jerome (Fall)

    • 3 hours
    • Prerequisites: COMP 251 and MATH 323
    • Restriction: Not open to students who have taken COMP 562. Not open to students who are taking or have taken COMP 561.
  • COMP 563 Molecular Evolution Theory (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : Population genetics; statistical inference from sequence data; phylogenetics, coalescent theory; models of mutation and selection.

    Terms: This course is not scheduled for the 2010-2011 academic year.

    Instructors: There are no professors associated with this course for the 2010-2011 academic year.

    • 3 hours
    • Prerequisites: COMP 251 or COMP 252, MATH 323 or equivalent; or by permission of instructor.
  • COMP 564 Computational Gene Regulation (3 credits)

    Offered by: Computer Science (Faculty of Science)

    Overview

    Computer Science (Sci) : This course examines computational problems related to gene regulation at the mRNA and protein levels. With respect to mRNA expression, topics include microarray analysis, SNP detection, and the inference of genetic networks. With respect to protein expression, topics include peptide sequencing, peptide identification, and the interpretation of interaction maps.

    Terms: This course is not scheduled for the 2010-2011 academic year.

    Instructors: There are no professors associated with this course for the 2010-2011 academic year.

    • 3 hours
    • Prerequisite: COMP 462.
  • MATH 240 Discrete Structures 1 (3 credits)

    Offered by: Mathematics and Statistics (Faculty of Science)

    Overview

    Mathematics & Statistics (Sci) : Mathematical foundations of logical thinking and reasoning. Mathematical language and proof techniques. Quantifiers. Induction. Elementary number theory. Modular arithmetic. Recurrence relations and asymptotics. Combinatorial enumeration. Functions and relations. Partially ordered sets and lattices. Introduction to graphs, digraphs and rooted trees.

    Terms: Fall 2010

    Instructors: Shepherd, Frederick (Fall)

    • Fall
    • Corequisite: MATH 133.
    • Restriction: For students in any Computer Science program. Others only with the instructor's permission. Not open to students who have taken or are taking MATH 235.
Faculty of Science—2010-2011 (last updated Jan. 19, 2011) (disclaimer)
Back to top