[CPM-SPIRE-L] TUDASTIC 2022 - Call for participation - May 9-10 2022

[Camille Marchet]

====================================================================
                            Call for participation

                               TUDASTIC 2022
             1st edition of the thematic school TUtorials
     on DAta Structures for Text Indexation and Compression
                      Lille, France, May 9-10 2022
====================================================================

TUDASTIC aims to gather computer scientists interested in text data
structures from various fields. It intends to facilitate exchanges and
interdisciplinarity between communities that usually hardly communicate and
yet work on related problems. Presentations in the form of tutorials are
encouraged in order to maximize the pedagogical impact and transmission.
Speakers will present their expertise on a chosen data-structure and/or
related algorithms and/or implementation.

Topics of interest include data-structures for: text indexing, string
processing, information retrieval, text compression, self-indexing,
representation of Boolean functions and of database queries ; and their
applications: search tasks, string pattern matching, (bioinformatics) read
alignment and indexation, meta/pan-genomics, transcriptomics, (database)
 graph databases, text mining, document processing, aggregation.

The conference will be held at the CRIStAL laboratory, on the scientific
campus of University of Lille. It will take place on May, 9 and 10, 2022.
*Registrations are free but mandatory. Please provide us by email with your
name, affiliation, arrival/departure dates and any special demand (diets,
...) at tudastic at univ-lille.fr <tudastic at univ-lille.fr>.*

Application for student travel grants should be submitted by email at
tudastic at univ-lille.fr.

This meeting is supported by Université de Lille, LINKS Inria team (Lille)
and BONSAI team (Lille), CRIStAL, CNRS, Inria and GDR-IM.

=================
INVITED SPEAKERS
=================
* Giulio Ermanno Pibiri (HPC-Lab, ISTI-CNR, Pisa, Italy), *On Weighted
K-Mer Dictionaries*
* Louis Jachiet (Télécom Paris),
*Measuring the algorithmic complexity of algorithms : RAM model, lower
bounds, upper bounds*
=================
ORGANIZATION COMMITTEE
=================
* Florent Capelli, Université de Lille
* Camille Marchet, CNRS, Lille
* Charles Paperman, Université de Lille

All questions about TUDASTIC should be emailed to tudastic at univ-lille.fr

=================
PROGRAM AND STEERING COMMITTEE
=================
* Camille Marchet, CNRS, Lille
* Leena Salmela, University of Helsinki
* Florent Capelli, Université de Lille
* Charles Paperman, Université de Lille
* Blerina Sinaimeri, LUISS University, Rome
* Arnaud Mary, Université Claude Bernard Lyon 1
* Antoine Limasset, CNRS, Lille
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://fenris.cs.ucr.edu/pipermail/cpm-spire-l/attachments/20220415/286398b7/attachment.html>