392189 Algorithms in Comparative Genomics (V) (SoSe 2018)
Contents, comment
-
Many questions in molecular biology, phylogenetics, and biomedicine can be approached through comparison of two or more genomes. However, a global alignment of multiple large genomes is often infeasible or comes at great expense. It is more efficient to compare genomes on a higher level of abstraction, as given by the succession of single-copy genes or other kinds of unique genomic markers on the chromosomal sequences.
In this course, various models of higher level genome comparison are discussed. We start with the classical reversal distances which are measures to study chromosomal sequences only permuted by inversions. We then continue by discussing distances such as SC/J or DCJ, and a general rearrangement distance. It then follows a discussion of methods that solve the problem of comparing sequences with unequal gene/marker content. We will also study methods for the reconstruction of ancestral genomes.
Algorithms discussed in this course are mostly combinatorial by nature, similar to the sequence analysis course.
This course is taught in German or English if needed.
Requirements for participation, required level
-
Required: Algorithms and Data Structures (or comparable)
Recommended: Sequence Analysis and Foundations of Genome Research
External comments page
Teaching staff
Dates ( Calendar view )
| Frequency | Weekday | Time | Format / Place | Period |
|---|
Subject assignments
| Module | Course | Requirements | |
|---|---|---|---|
| 39-Inf-SAB_a Spezielle Algorithmen der Bioinformatik | Ausgewählte Vorlesung zu Spezielle Algorithmen der Bioinformatik | Ungraded examination
Graded examination |
Student information |
The binding module descriptions contain further information, including specifications on the "types of assignments" students need to complete. In cases where a module description mentions more than one kind of assignment, the respective member of the teaching staff will decide which task(s) they assign the students.
- Registered number: 12
- This is the number of students having stored the course in their timetable. In brackets, you see the number of users registered via guest accounts.
- Address:
- SS2018_392189@ekvv.uni-bielefeld.de
- This address can be used by teaching staff, their secretary's offices as well as the individuals in charge of course data maintenance to send emails to the course participants. IMPORTANT: All sent emails must be activated. Wait for the activation email and follow the instructions given there.
- If the reference number is used for several courses in the course of the semester, use the following alternative address to reach the participants of exactly this: VST_118943515@ekvv.uni-bielefeld.de
- Coverage:
- 2 Students to be reached directly via email
- Notes:
- Additional notes on the electronic mailing lists
- Last update basic details/teaching staff:
- Tuesday, November 21, 2017
- Last update times:
- Friday, February 2, 2018
- Last update rooms:
- Friday, February 2, 2018
- Type(s) / SWS (hours per week per semester)
- lecture (V) / 2
- Language
- This lecture is taught in english
- Department
- Faculty of Technology
- Questions or corrections?
- Questions or correction requests for this course?
- Planning support
- Clashing dates for this course
- Links to this course
- If you want to set links to this course page, please use one of the following links. Do not use the link shown in your browser!
- The following link includes the course ID and is always unique:
- https://ekvv.uni-bielefeld.de/kvv_publ/publ/vd?id=118943515
- Send page to mobile
-
Click to open QR code
Scan QR code:
- ID
- 118943515