Skip to main content
 

COMP3487: BIOINFORMATICS

Please ensure you check the module availability box for each module outline, as not all modules will run in each academic year. Each module description relates to the year indicated in the module availability box, and this may change from year to year, due to, for example: changing staff expertise, disciplinary developments, the requirements of external bodies and partners, and student feedback. Current modules are subject to change in light of the ongoing disruption caused by Covid-19.

Type Open
Level 3
Credits 10
Availability Available in 2024/2025
Module Cap None.
Location Durham
Department Computer Science

Prerequisites

  • COMP2271 Data Science

Corequisites

  • None.

Excluded Combinations of Modules

  • None.

Aims

  • To introduce students to applications of Computer Science in Biology.
  • To introduce students to some important Statistical methods and algorithms.

Content

  • Dynamic programming algorithms for sequence alignment.
  • Efficient heuristic algorithms for sequence alignment.
  • Markov Chains and Hidden Markov Models (HMM).
  • Expectation-Maximisation algorithm with an application to parameter-estimation in HMM.
  • Phylogenetic Trees as a model of Evolution.
  • Maximum parsimony and character-based techniques for tree reconstruction.
  • Distance-based tree reconstruction via neighbour-joining techniques.

Learning Outcomes

Subject-specific Knowledge:

  • On completion of the module, students will be able to demonstrate:
  • an understanding of the basic computational problems in Biology.
  • an understanding of some fundamental statistical techniques.
  • an understanding of basic tree-reconstruction algorithms.

Subject-specific Skills:

  • On completion of the module, students will be able to demonstrate:
  • an ability to implement key algorithms within the area.
  • an ability to identify what methods are applicable to given Biological data.

Key Skills:

  • On completion of the module, students will be able to demonstrate:
  • an ability to abstract out a computational problem from a real-world one.
  • an ability to solve a computational problem by an exact algorithm or a heuristic one.

Modes of Teaching, Learning and Assessment and how these contribute to the learning outcomes of the module

  • Lectures enable the students to learn new material relevant to applications of Computer Science and Statistics in Biology.
  • Summative assessment assess the application of methods and techniques learned to solving computational problems in Biology.

Teaching Methods and Learning Hours

ActivityNumberFrequencyDurationTotalMonitored
lectures222 per week1 hour22 
preparation and reading78 
total100 

Summative Assessment

Component: ExaminationComponent Weighting: 100%
ElementLength / DurationElement WeightingResit Opportunity
Examination2 hours100No

Formative Assessment

Example formative exercises are given during the course.

More information

If you have a question about Durham's modular degree programmes, please visit our FAQ webpages, Help page or our glossary of terms. If you have a question about modular programmes that is not covered by the FAQ, or a query about the on-line Undergraduate Module Handbook, please contact us.

Prospective Students: If you have a query about a specific module or degree programme, please Ask Us.

Current Students: Please contact your department.