|
|
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 Monday, October 31 in Benjamin-122. 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. Exam and ProjectsEach student must participate in a series of mandatory projects. Currently three projects are planned. The projects can be done in groups of 2-3 students. The final exam is an individual oral exam (20 min) which includes a discussion related to one of the mandatory projects followed by a general discussion of related topics. You should prepare a 8-10 minutes presentation of your project work and 6-8 minutes presentation of the topic specified in the exam question. See the list of exam questions for details. The exam dates are January 23-25, 2006. The exam will take place according the exam list. Note that there are people on this list that have not yet got the last project approved. Remember that you have to hand in all three projects in order to qualify for the exam. 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 |