Summer school
There will be a summer school on June 20-21 at the University of Electro-Communications, Chofu, Tokyo, Japan.
There will be two lecturers:
Jesper Jansson (Kyoto University, Japan)
Jesper Jansson received the Ph.D. degree in Computer Science from Lund University in Sweden. He is currently an Associate Professor at Kyoto University in Japan and the Section Editor-in-Chief for the "Analysis of Algorithms and Complexity Theory" section of the MDPI open-access journal "Algorithms". His main research areas are graph algorithms, data structures, computational complexity, and bioinformatics, and he is especially interested in combinatorial problems from the biological sciences that can be expressed elegantly and solved efficiently using graphs and tree structures.
Title: Phylogenetic consensus trees
Abstract: Phylogenetic trees are commonly used by scientists to describe evolutionary relationships. However, inferring an accurate phylogenetic tree can be a difficult task. An important problem is therefore to combine a given set of alternative phylogenetic trees having the same leaf labels but different branching structures into a single tree called a consensus tree in the best way possible. This lecture will survey fast algorithms for constructing the most popular types of consensus trees, using various definitions of "in the best way possible" proposed in the last half-century, and discuss some related open problems.
Philip Wellnitz (National Institute of Informatics, Japan)
Philip Wellnitz received his Ph.D. degree in Computer Science from Saarland University in Germany. Then, he spent two and a half years as a postdoctoral researcher at the Max Planck Institute for Informatics, where he was coordinating the "Parameterized and Counting Algorithms and Complexity" research area and co-coordinating the "String Algorithms and Data Compression" research area. From April 2024, he is an Assistant Professor at the National Institute of Informatics (NII) in Tokyo. He is interested in designing efficient algorithms and matching (conditional) lower bounds for pattern matching problems in general and specifically for approximate string matching problems, as well as (counting) problems in graphs, among others.
Title: From Strings to Seaweeds: Modern Tools for Classical Problems
Abstract: Introduced in recent years by Tiskin [SODA'10, Algorithmica'15], the seaweed monoid of permutation matrices has been a crucial ingredient to obtaining recent theoretical breakthroughs in the realm of (approximate) string matching. We are going to discuss the basic ideas behind Tiskin's seaweed technology, as well as some of the recent applications to computing approximate occurrences of one string in another string (meaning with at most k errors) and to computing the (weighted) edit distance between strings.
Registration:
The school is organized by Paweł Gawrychowski (gawry[at]cs.uni.wroc.pl), Hideo Bannai (hdbn.dsc[at]tmd.ac.jp) and Takuya Mieno (tmieno[at]uec.ac.jp).