|
|
StrAlg
|
Announcements
AboutString-algorithms are an important aspect of many computer science disciplines, such as data-compression, cryptography, speech- and image-recognition, and computational biology. Furthermore, string algorithms is an interesting theoretical field in itself, with many fascinating problems and elegant solutions. In this course, we give an introduction to string algorithms -- mainly the theoretical aspects of string algorithms, but with some examples of applications in the mandatory projects. See official course description. ScheduleCheck the weekly schedule for information about each lecture. Lectures take place:
First lecture is on Tuesday, October 26 in Adorno-138. LiteratureWe will use the following book, which will be available in the GAD bookstore:
Additional research papers will be handed out in class or made available for download. ProjectsEach student must participate in the series of mandatory projects. Currently three projects are planned. The last project will be graded on the 13-scale and will be the final grade. The projects can be done in groups of 2-3 students. LecturerIf you have any comments or questions related to the course, do not hesitate to contact one of the lectures: Office: 090.110 Christian Nørgaard Storm Pedersen Office: 090.112 |