• Home
  • About
  • Mobile
  • Open Content
  • Search

Module Overview


  • Description
  • Facilitators
  • Weblinks
  • Timetable
CS2220 

INTRODUCTION TO COMPUTATIONAL BIOLOGY
   2018/2019, Semester 1
   School of Computing (Computer Science)
Modular Credits: 4
  Tags: --

Learning Outcomes

TopThe aim of this course is three folds. First, the course provides an overview of common computational techniques used in the field of bioinformatics, including similarity operations, clustering, and classification techniques. Second, the course introduces several computational tasks that are commonly encountered by bioinformaticians and discusses their solutions. Last, but not least, the course demonstrates the role of bioinformaticians as a bridge between the field of computer science and biology, and prepares students for advanced computer-science topics relevant to bioinformatics.
 

The student will master the basic tools and approaches for analysis of DNA sequences, protein sequences, gene expression profiles, etc. He will have a good understanding of important problems and applications of computational biology such as identification of functional features in DNA and protein sequences, prediction of protein function, deriving diagnostic models from gene expression profiles, etc. He will also have the confidence to propose new solutions in these applications as well as new emerging problems in computational biology. 
 

Prerequisites

TopStudents should be familiar with data structures and algorithms (e.g. CS1020, CS1020E, CS2020, CS2040, or CS2040C).

Students may also find some background in molecular cell biology (e.g. LSM1106), biochemistry (e.g. LSM1101), and molecular genetics (e.g. LSM1102) useful. 
 

Teaching Modes

TopThe course adopts a lecture format that is interspersed with several short tutorial/discussion slots, which is akin to an on-the-fly flip classroom approach.

The lectures are based on case studies on a variety of bioinformatics problems. The emphasis is on analysis and problem-solving skills relevant to bioinformatics, as well as core principles that cut across multiple bioinformatics problems, rather than specific algorithms.
 

Synopsis

TopThe goals of CS2220 (Introduction to Computational Biology) are:
  1. Development of flexible and logical problem-solving skills.
  2. Understanding of main bioinformatics problems.
  3. Appreciation of main techniques and approaches to bioinformatics.

To achieve the goals above, students are exposed to a series of case studies spanning gene feature recognition, gene expression and proteomic analysis, sequence homology interpretation, phylogeny analysis, mutation-phenotype association, etc. 
 

Syllabus

Top

The course plan is as follows:

  • Essence of Bioinformatics [1 hour, integrated into various lectures]
    • Overview of molecular biology
    • Overview of tools and instruments for molecular biology
    • Overview of themes and applications of bioinformatic
       
  • Essence of Knowledge Discovery [3-4 hours]
    • Basic classification performance measures and techniques
    • Introduction to feature-selection techniques
    • Introduction to machine-learning techniques
    • [Brief overview only. No algorithmic details] 
       
  • Gene-Feature Recognition from Genomic DNA [3-4 hours]
    • The “feature generation, feature selection, feature integration” approach.
    • Case study of “translation initiation site” (TIS) recognition
    • Case study of “transcription start site” (TSS) recognition
    • [Some other gene feature recognition problems may be used in the lecture instead of TIS and TSS.]
    • [Concentrate on methodologies, not algorithms.]
       
  • Gene Expression Analysis [3-4 hours]
    • Microarray basics
    • Case study of classification of gene expression profiles
    • Case study of clustering of gene expression profiles
    • Case study of molecular network reconstruction by gene expression profiles
    • [Some other gene expression analysis problems may be used in the lecture instead of molecular network reconstruction.] 
    • [Concentrate on methodologies, not algorithms.]
       
  • Essence of Sequence Comparison [3-4 hours] 
    • Dynamic programming basics
    • Sequence comparison and alignment basics
    • Case study of the Needleman-Wunsh global alignment algorithm
    • Case study of the Smith-Waterman local alignment algorithm
    • Case study of the BLAST heuristic-based similarity search method
    • [Basic concepts only]
       
  • Sequence Homology Interpretation [3-4 hours]
    • Case study of protein function prediction by sequence alignment
    • Case study of protein function prediction by phylogenetic profiling
    • Case study of active site and domain prediction
    • Case study of key mutation sites prediction
       
  • Phylogenetic Trees [3-4 hours]
    • Phylogeny reconstruction method basics
    • Case study on the origin of Polynesians
    • Case study on the origin of Europeans
    • Reconciliation of phlogenetic trees
       
  • Some additional topics---e.g. disease/phenotype mutations---may be discussed if there is sufficient time.

Assessment

TopThere will be
  • 3 assignments worth 35% of the total module marks.
  • 1 project worth 15% of the total module marks.
  • 1 final exam worth 50% of the total module marks.

Workload

Top2 lecture hours per week.
1 tutorial hours per week. The tutorial is interspersed into the lecture.
0 lab hours per week.
3 hours for projects, assignments, fieldwork, etc. per week.
4 hours for preparatory work by a student per week

Contact

  • IVLE Webmaster

Social Media

Latest Alerts

  • IVLE scheduled maintenance every Tuesday 0300 hrs - 0700 hrs

Centre for Instructional Technology

Legal  |  Acceptable Use Policy

Copyright © 2015, National University of Singapore. All rights reserved.