GEOMAR  Career & Campus  Campus  Studying  BSc: Physics of the Earth System  Course List
UnivIS
Informationssystem der Universität Kiel © Config eG 
Semester: SS 2024 

Inf-AlgSeq: Algorithms on Sequences (Inf-AlgSeq) (080194)

Dozent/in
Dr. Pamela Fleischmann

Angaben
Vorlesung, 2 SWS, ECTS-Studium, ECTS-Credits: 6
für ERASMUS-/Austauschstudierende geeignet, Unterrichtssprache Englisch
Zeit und Ort: Do 8:15 - 9:45, LMS8 - R.EG.016 (40)
vom 14.4.2024 bis zum 14.7.2024
1. Prüfungstermin (Klausur am Ende der Vorlesungszeit eines Semesters): 25.7.2024, 8:00 - 11:00 Uhr, Raum CAP2 - Hörsaal C; 25.7.2024, 8:00 - 11:00 Uhr, Raum CAP2 - Hörsaal D
Bemerkung zu Zeit und Ort: https://uni-kiel.zoom.us/j/85901292410?pwd=OXZkdSs4b1hGbW82QnBFOEFVeCtwUT09%0A%0AMeeting%20ID:%20859%200129%202410%0APasscode:%20686873

Voraussetzungen / Organisatorisches
Veranstaltung ist als Hybrid-Veranstaltung geplant - Raum folgt.

Inhalt
This course is an introduction into the theory of stringology, or algorithms on sequences of symbols (also called words or strings). Our main intention is to present a series of basic algorithmic and combinatorial results, which can be used to develop efficient word-processing tools. While the emphasis of the course is on the theoretical side of stringology, we also present a series of applications of the presented concepts in areas like data-compression or computational biology. We expect that the participants to this course will gain an understanding of classical string-processing tools. They are supposed to understand and be able to use in various situations: classical text algorithms (e.g., pattern matching algorithms, edit distance), classical text indexing data structures (e.g., suffix arrays / trees), and classical combinatorial results that are useful in this context (e.g., periodicity lemmas). The main topics our course will cover are: basic combinatorics on words, pattern matching algorithms, data structures for text indexing (suffix arrays, suffix trees), text compression (Huffman encoding, Lempel-Ziv method), detection of regularities in words, algorithms for words with don't care symbols (partial words), word distance algorithms, longest common subsequence algorithms, approximate pattern matching. The presentation of each theoretical topic from the above will be accompanied by a brief discussion on its possible applications.

Zusätzliche Informationen
Erwartete Teilnehmerzahl: 40
www: https://elearn.informatik.uni-kiel.de/course/view.php?id=245

Zugeordnete Lehrveranstaltungen
UE: Exercise: Algorithms on Sequences (080228)
Dozent/in: Dr. Pamela Fleischmann
Zeit und Ort: Di 12:15 - 13:45, CAP4 - R.13.1304 a
UnivIS ist ein Produkt der Config eG, Röttenbach