Program


Some Proposed Topics

  • Grammars Compressions and Squares. H. Bannai, Kyushu University
  • Linear Time Critical Factorization in Different Models of Computation. D. Breslauer, University of Haifa
  • On the Run's Conjecture. M. Crochemore, King's College London
  • On V-Ordering. J. W. Daykin, King's College London and Royal Holloway College
  • On Unbordered Words. G. Fici, Université de Nice
  • Gene Permutation Discovery Problem. G. Franco, University of Verona
  • Methods for Findings Distinct Squares in Strings. F. Franek, Mcmaster University
  • Huffman Codes: Theoretical and Practical Aspects. T. Gagie, Aalto University
  • Palindrome String Matching. T. I, Kyushu University
  • Related Stringology Problems to EEGs and to Musicolgy. C. Iliopoulos, King's College London
  • Indexing With Permutations. G. M. Landau, University Of Haifa
  • Combinatorial Problems on Multidimensional Sturmian Words. F. Mignosi, University of L'aquila
  • Text Compression via Dictionary-Symbolwise. F. Mignosi, University of L'aquila
  • On the Characterization of Words Permutations Corresponding to BWT. A. Restivo, University of Palermo

Participants of StringMasters are free to interact with each other or to form new research groups, as they see fit. Speakers will present their researches and problems in the scheduled time, but, depending on the interactions between participants, schedule can be freely modified. The aim of Stringmasters is not just to present to colleagues research topics and open problems, but also to stimulate the creation of spontaneous group of researchers to tackle the presented problems!

Seminar rooms will be available for discussion as required.