Presentation schedule of LAW2007

* Please note the venues has changed.

7 Feb 2007 (Wed) Venue(morning sessions): Council Room, Strand campus Venue (afternoon sessions): Franklin-Wilkins Building Room 1.67, Waterloo campus
0915-0945	Registration
0945-1015	Bill Smyth (McMaster University) Fast & Practical Algorithms for Computing All the Runs in a String
1015-1045	Lucian Ilie (Universite de Marne-la-Vallee & University of Western Ontario) Repetitions in Strings
1045-1100	Coffee Break
1100-1130	Bořivoj Melichar (CTU Prague) Palindromes and Finite Automata
1130-1200	Thierry Lecroq (University of Rouen) Fast exact string matching algorithms
1200-1430	Lunch
1430-1500	Gregory Gutin (Royal Holloway, University of London) Algorithms for Directed Maximum Leaf Problems
1500-1530	Frantisek Franek (McMaster University) On a lower bound of the maximum number of runs
1530-1600	Coffee Break
1600-1630	Rob Irving (University of Glasgow) A 5/3-approximation algorithm for a hard case of stable marriage
1630-1700	Barnaby Martin (University of Durham) The Computational Complexity of the Regular Resolution Width Problem
1700-1730	Marie-Pierre Béal (Université de Marne-la-Vallée) On the synchronization delay of complete local automata

8 Feb 2007 (Thu) Venue(morning and afternoon sessions): Council Room, Strand campus
0915-0945	Michal Voracek (CTU Prague) The Constrained Longest Common Subsequence Problem for Degenerate Strings - A Finite Automata Approach
0945-1015	Alexander Tiskin (University of Warwick) Semi-local string comparison: algorithmic application
1015-1045	Tugkan Batu (London School of Economics) Oblivious String Embeddings and Edit Distance Approximations
1045-1100	Coffee Break
1100-1130	Laurent Mouchard (University of Rouen) Searching for shortest tags in a set of sequences using a suffix array
1130-1200	Alexander Chashkin (Moscow State University) Two algorithms for computing monotone Boolean functions
1200-1230	Xiangchao Gan (King's College London) Microarray missing data imputation based on biological knowledge
1230-1430	Lunch
1430-1500	Wojciech Rytter (Warsaw University) On some Occurrence and Lexicographic Properties of Standard Sturmian Words
1500-1530	Pierre Peterlongo (IRISA/INRIA Sybiose team) Utilisation of Subset Seeds on a Reconfigurable Architecture
1530-1600	Coffee Break
1600-1630	Gabriel Valiente (Technical University of Catalonia) Computing the Transposition Distance between Phylogenetic Trees
1630-1700	Jens Kleinjung (National Institute for Medical Research) Automatic derivation of maximally representative database subsets based on fragments
1700-1730	Jan Holub (CTU Prague) Evolutive Pattern Retrieval using Suffix Automata

Coffee Break