ParticipantsCall for Papers: Special Issue of Mathematics in Computer Science (MCS) on Combinatorial Algorithms
| Speakers | Title of talks |
| Tugkan Batu London School of Economics |
Oblivious
String Embeddings and Edit Distance
Approximations [Abstract] [Slides] |
| Marie-Pierre Béal
Université de Marne-la-Vallée |
On the
synchronization delay of complete local automata [Abstract] [Slides] |
| Alexander
Chashkin Moscow State University |
Two
algorithms for computing monotone Boolean functions [Abstract] [Slides] |
| Frantisek
Franek McMaster University |
On a lower
bound of the maximum number of runs [Abstract] [Slides] |
|
Xiangchao Gan King's College London |
Microarray missing data imputation based on biological knowledge [Abstract] [Slides] |
| Gregory Gutin Royal Holloway, University of London |
Algorithms for Directed Maximum Leaf Problems [Abstract] [Slides] |
| Jan Holub CTU Prague |
Evolutive
Pattern Retrieval using Suffix Automata [Abstract] [Slides] |
| Lucian Ilie Universite de Marne-la-Vallee & University of Western Ontario |
Repetitions
in Strings [Abstract] [Slides] |
| Rob Irving University of Glasgow |
A
5/3-approximation algorithm for a hard case of stable
marriage [Abstract] [Slides] |
| Jens Kleinjung National Institute for Medical Research |
Automatic
derivation of maximally representative
database subsets based on fragments [Abstract] [Slides] |
| Thierry
Lecroq University of Rouen |
Fast exact
string matching algorithms [Abstract] [Slides] |
| Barnaby Martin University of Durham |
The
Computational Complexity of the Regular Resolution Width Problem [Abstract] [Slides] |
| Bořivoj Melichar CTU Prague |
Palindromes
and Finite Automata [Abstract] [Slides] |
| Pierre Peterlongo IRISA/INRIA Sybiose team |
Utilisation
of Subset Seeds on a Reconfigurable Architecture [Abstract] [Slides] |
| Wojciech Rytter Warsaw University |
On some
Occurrence and Lexicographic Properties of
Standard Sturmian Words [Abstract] [Slides] |
| Bill Smyth McMaster University |
Fast
& Practical Algorithms for Computing All
the Runs in a String [Abstract] [Slides] |
| Alexander Tiskin University of Warwick |
Semi-local
string comparison: algorithmic application [Abstract] [Slides] |
| Gabriel Valiente Technical University of Catalonia |
Computing
the Transposition Distance between Phylogenetic Trees [Abstract] [Slides] |
| Michal Voracek CTU Prague |
The
Constrained Longest Common Subsequence Problem for Degenerate Strings -
A Finite Automata Approach [Abstract] [Slides] |
Pavlos Antoniou
Aristeidis Bakalis
Joseph Chan (Co-chair)
Maxime Crochemore (Co-chair)
J W Daykin
Costas Iliopoulos
Inuka Jayasekera
Leonidas Kapsokalivas
Spiridon Michalakopoulos
Alexandros Skaliotis
Mohammad Sohel Rahman
Kathleen Steinhöfel
This workshop is sponsored by the Department of Computer Science, King's College London
