Study programme 2022-2023Français
Algorithms and Bioinformatics
Programme component of Master's in Mathematics (MONS) (day schedule) à la Faculty of Science

CodeTypeHead of UE Department’s
contact details
Teacher(s)
US-M1-SCMATH-012-MOptional UEDELGRANGE OlivierS829 - Informatique théorique
  • DELGRANGE Olivier

Language
of instruction
Language
of assessment
HT(*) HTPE(*) HTPS(*) HR(*) HD(*) CreditsWeighting Term
  • Français
Français150300066.001st term

AA CodeTeaching Activity (AA) HT(*) HTPE(*) HTPS(*) HR(*) HD(*) Term Weighting
S-INFO-022Algorithms and Bioinformatics1503000Q1100.00%

Programme component

Objectives of Programme's Learning Outcomes

  • Have integrated and elaborate mathematical knowledge.
    • Mobilise the Bachelor's course in mathematics to address complex issues and have profound mathematical expertise to complement the knowledge developed in the Bachelor's course.
  • Carry out major projects.
    • Independently carry out a major project related to mathematics or mathematical applications. This entails taking into account the complexity of the project, its objectives and the resources available to carry it out.
    • Give constructive criticism on the quality and progress of a project.
    • Work in teams and, in particular, communicate effectively and with respect for others.
    • Present the objectives and results of a project orally and in writing.
  • Apply innovative methods to solve an unprecedented problem in mathematics or within its applications.
    • Appropriately make use of computer tools, as required by developing a small programme.

Learning Outcomes of UE

At the end of the instruction, the students will be able to explain the development needs of algorithms and data structures in the context of voluminous data such as genetic sequences. Students will be able to explain the classical algorithms for bioinformatics and string-matching. They will be able to implement algorithms for efficient manipulation of DNA sequences.

UE Content: description and pedagogical relevance

Algorithms, complexity of algorithms, strings, string-matching, sequence alignment; suffix tree; DNA sequencing and fragment assembly

Prior Experience

algorithmic, complexity of algorithms, programming in an imperative or object language

Type of Teaching Activity/Activities

AAType of Teaching Activity/Activities
S-INFO-022
  • Cours magistraux
  • Conférences
  • Préparations, travaux, recherches d'information

Required Learning Resources/Tools

AARequired Learning Resources/Tools
S-INFO-022Not applicable

Recommended Learning Resources/Tools

AARecommended Learning Resources/Tools
S-INFO-022Not applicable

Other Recommended Reading

AAOther Recommended Reading
S-INFO-022- Introduction to Computational Molecular Biology
  J. Setubal, J. Meidanis
  PWS Publishing Company, 1997
- Algorithmic Aspects of Bioinformatics
  HJ Böckenhauer - D. Bongartz
  Springer, 2007

Grade Deferrals of AAs from one year to the next

AAGrade Deferrals of AAs from one year to the next
S-INFO-022Authorized

Term 1 Assessment - comments

AATerm 1 Assessment - comments
S-INFO-022Not applicable

Term 3 Assessment - comments

AATerm 3 Assessment - comments
S-INFO-022Not applicable
(*) HT : Hours of theory - HTPE : Hours of in-class exercices - HTPS : hours of practical work - HD : HMiscellaneous time - HR : Hours of remedial classes. - Per. (Period), Y=Year, Q1=1st term et Q2=2nd term
Date de dernière mise à jour de la fiche ECTS par l'enseignant : 09/11/2021
Date de dernière génération automatique de la page : 20/06/2023
20, place du Parc, B7000 Mons - Belgique
Tél: +32 (0)65 373111
Courriel: info.mons@umons.ac.be