The 25th London Stringology Days & London Algorithmic Workshop

LSD & LAW 2017

February 9-10 2017

LSD & LAW 2017 – Programme

Thursday 9th February 2017

09:00-09:30

Registration

09:30-09:45

Opening and welcome by Professor Luca Viganò,

Head of the Department of Informatics in the Faculty of Natural and Mathematical Sciences

First session, Chair: Maxime Crochemore

09:45-10:45

Invited talk:

Wing-Kin Sung

Methods for Constructing Phylogenetic Consensus Tree

10:45-11:10

Coffee Break

Second session, Chair: Michael Soltys

11:10-11:35

William F. (Bill) Smyth and Franya Franek

Unexpected Equivalence: Lyndon Array & Suffix Array

11:35-12:00

Panagiotis Charalampopoulos

How to Answer a Small Batch of RMQs or LCA Queries in Practice

12:00-14:30

Lunch

            Third session (Advances in Mathematical Aspects of Uncertain Data), Chair: Bill Smyth

14:30-14:55

Jakub Radoszewski and Tatiana Starikovskaya

Streaming k-Mismatch with Error Correcting and Applications to Weighted Pattern Matching

14:55-15:20

Carl Barton

Efficient Index for Weighted Sequences

15:20-15:45

Chang Liu

On-Line Pattern Matching on Uncertain Sequences and Applications

15:45-16:15

Coffee Break

Fourth session, Chair: Nadia Pisanti

16:15-16:40

Tatiana Rocher

Indexing Labeled Sequences

16:40-17:05

Mai Alzamel

Faster Algorithms for 1-Mappability

17:05-17:30

Bruce W. Watson

Extending Dead-Zone Matching to Data-Shapes Higher than Strings


Friday 10th February 2017

 

First session, Chair: Gad Landau

09:45-10:45

Invited talk:

Gregory Gutin

Algorithms on Branchings in Digraphs

10:45-11:10

Coffee Break

Second session, Chair: Franya Franek

11:10-11:35

Michael Soltys and Joel Helling

Constructing an Indeterminate String from its Associated Graph

11:35-12:00

Oded Lachish

Trading Query Complexity for Sample-Based Testing and Multi-Testing Scalability

12:00-14:30

Lunch

Third session, Chair: Gregory Gutin

14:30-14:55

Václav Blažej

A Simpler Bit-parallel Algorithm for Swap Matching

14:55-15:20

Simone Faro

Verifiable Pattern Matching on Outsourced Texts

15:20-15:45

Bhaskar DasGupta

On the Computational Complexities of Three Privacy Measures for Large Networks Under Active Attack

15:45-16:15

Coffee Break

Fourth session, Chair: Simon Puglisi

16:15-16:40

Sergio De Agostino

Parallel On the Fly Massive Data Compression and the LZMW Heuristic

16:40-17:05

Keita Kuboi

Faster STR-IC-LCS Computation via RLE

17:05-17:15

Closing Remarks