The 26^th London Stringology Days & London Algorithmic Workshop

09:00-09:40

Registration

09:40-09:45

Opening and Welcome

First session chaired by Solon Pissis

09:45-10:35

Invited talk:

Roberto Grossi

Combining Strings and Graphs for Subgraph Similarity

10:35-11:10

Coffee Break

Second session chaired by Maxime Crochemore

11:10-11:35

Bill Smyth

New Approaches to Covering a String

11:35-12:00

Steven Watts

Efficient Identification of k-closed Strings

12:00-14:30

Lunch

            Third session chaired by Tomasz Waleń

14:30-15:20

Invited talk:

Roman Kolpakov

Some results on the number of Periodic Factors in Words

15:20-15:45

Gabriel Valiente

A Set Cover Approach to Taxonomic Annotation

15:45- 16:20

Coffee Break

Fourth session chaired by Bill Smyth

16:20-16:45

Eric Rivals

Hierarchical Overlap Graph

16:45-17:10

Mireille Régnier

Repetition Lengths in Random Sequences

17:10-17:35

Nantia Iakovidou

A symbolic dynamics approach to Epileptic Chronnectomics: Employing strings to predict seizure onset

First session chaired by Robert Mercas

09:45-10:35

Invited talk:

Arseny Shur

Make Pals Your Pals: Fast Algorithms for Problems Related to Palindromes

10:35-11:10

Coffee Break

Second session chaired by Tatiana Starikovskaya

11:10-11:35

Bill Smyth

On the Parikh-de-Bruijn Grid

11:35-12:00

Raphael Wegner

Call Admission Problems on Grids

12:00-14:30

Lunch

            Third session chaired by Eric Rivals

14:30-15:20

Invited talk:

Tatiana Starikovskaya

Streaming and Property Testing Algorithms for String Processing

15:20-15:45

Cyril Nicaud

On the Biased Partial Word Collector Problem

15:45-16:20

Coffee Break

Fourth session chaired by Roberto Grossi

16:20-16:45

Tomasz Radzik

Perpetual Maintenance of Machines with Different Attendance Urgency Factors

16:45-17:10

Eric Rivals

Approximation for Computing Superstrings with Multiplicities

17:10-17:35

Michele Zito

Large Independent Sets in Line of Sight Networks

17:35-17:40

Closing Remarks