392107 Advanced Dynamic Programming (ADP) (V) (SoSe 2013)
Contents, comment
-
Dynamic Programming is concerned with the optimization problems defined over search spaces of exponential size, yet allowing exact solution in polynomial space and time. It is on of the earliest computational paradigms, in fact developed by mathematicians before the term computer science had been established. Interest in dynamic programming has increased dramatically, as manyfold problems arising in biosequence analysis lend themselves to dynamic programming solutions. Still, the successful construction of a dynamic programming algorithm is a matter of experience, talent and luck.
The lecture will introduce dynamic programming using classical examples from biosequence analysis. It will then introduce the recent algebraic method of dynamic programming, which increases programming productivity by an order of magnitude.
Bibliography
-
Richard Bellman: Dynamic Programming.Princeton University Press, 1975.
Dan Gusfield: Algorithms on strings, trees and sequences.Cambridge University Press, 1997.
Durbin, Eddy, Krogh, Mitchell: Biological Sequence Analysis.Cambridge University Press, 1998.
External comments page
Teaching staff
Dates ( Calendar view )
| Frequency | Weekday | Time | Format / Place | Period |
|---|
Subject assignments
| Module | Course | Requirements | |
|---|---|---|---|
| 39-M-Inf-ADP Algebraische Dynamische Programmierung | Algebraische Dynamische Programmierung | Student information | |
| - | 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.
| Degree programme/academic programme | Validity | Variant | Subdivision | Status | Semester | LP | |
|---|---|---|---|---|---|---|---|
| Bioinformatik und Genomforschung / Master | (Enrollment until SoSe 2012) | Vertiefung Sequenzanalyse | Wahlpflicht | 2. | 5 | unbenotet LP V+Ü | |
| Naturwissenschaftliche Informatik / Diplom | (Enrollment until SoSe 2004) | BioI | HS | ||||
| Naturwissenschaftliche Informatik / Master | (Enrollment until SoSe 2012) | Vertiefung Sequenzanalyse | Wahlpflicht | 2. | 5 | unbenotet LP für V+Ü |
- Address:
- SS2013_392107@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_37010218@ekvv.uni-bielefeld.de
- Notes:
- Additional notes on the electronic mailing lists
- Last update basic details/teaching staff:
- Friday, December 11, 2015
- Last update times:
- Thursday, October 22, 2015
- Last update rooms:
- Wednesday, May 29, 2013
- 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=37010218
- Send page to mobile
-
Click to open QR code
Scan QR code:
- ID
- 37010218