Goals:
The students will gain a deeper unterstanding for basic algorithmic concepts for the analysis of genomic sequencing related to state of the art research in bioinformatics and biotechnology. They will learn various paradigms for the approximate search. They will know which algorithms should be preferred under what circumstances and are able to grasp key concepts of scientific publications related to this field.
Some examples of subjects that will be more deeply discussed:
- Paradigms for approximative, semiglobal alignments (read mapping)
- Methods for genomic assembly and metagenomic assembly
- Methods for the identification of genetic variants (SNVs, SNPs, CNVs) - algorithmic problems of quantifying expession using NGS data
For further information go to: https://kvv.imp.fu-berlin.de/portal/