<div dir="ltr">====================================================================<br> <span class="gmail-il">Call</span> for participation<br><br> <span class="gmail-il">TUDASTIC</span> 2022<br> 1st edition of the thematic school TUtorials<br> on DAta Structures for Text Indexation and Compression<br> Lille, France, May 9-10 2022<br>====================================================================<br><br><span class="gmail-il">TUDASTIC</span>
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.<br><br>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.<br><br>The thematic school 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.<br><b>Registrations are free but
mandatory. Please provide us by email with your name, affiliation,
arrival/departure dates and any special demand (diets, ...) at <a href="mailto:tudastic@univ-lille.fr" target="_blank"><span class="gmail-il">tudastic</span>@univ-lille.fr</a>.</b><br><br>Application for student travel grants should be submitted by email at <a href="mailto:tudastic@univ-lille.fr" target="_blank"><span class="gmail-il">tudastic</span>@univ-lille.fr</a>.<br><br>This
meeting is supported by Université de Lille, LINKS Inria team (Lille)
and BONSAI team (Lille), CRIStAL, CNRS, Inria and GDR-IM.<br><div><br></div><div><br></div><div><i>=================</i></div><div>PROGRAM</div><div><i>=================</i></div><div><div><div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid177"><span><b>May, 9</b></span></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid141"><ul><span class="gmail-im"><li><span>9h00 - 9h45 </span><span>Welcoming coffee</span></li></span><li><span><span>9h45 - 10h00 Introduction</span></span></li></ul></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid113"><ul><span class="gmail-im"><li><span>10h00 - 11h00 </span><span><b>Keynote: </b><span class="gmail-im"><span>Louis Jachiet </span><span>(</span></span></span><span>Télécom Paris) - <i>Measuring the algorithmic complexity of algorithms : RAM model, lower bounds, upper bounds</i></span></li><li><span>11h00 - 11h30 Thierry Lecroq</span><span> - </span><i><span>FM-index of Alignment with Gaps</span></i></li><li><span></span><span>11h30 - 12h00 </span><span>Sangsoo
Park, Sung Gwan Park, <u>Bastien Cazaux</u>, Kunsoo Park and Eric Rivals - <i>A
Linear Time Algorithm for Constructing Hierarchical Overlap Graphs </i></span><span></span><span><br></span></li></span></ul></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid162"><ul><li><span>12h</span><span>00</span><span> - 13h30 </span><span>Lunch</span></li></ul></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid83"><ul><li><span>13h30 - 14h30 Open discussions</span><i><span></span></i></li><li><span>14h30 - 15h00 </span><span>Charles Pa<span>perman</span><span> - </span><span></span></span><i><span><i><span>Efficient evaluation on data parallelism</span></i></span></i></li><li><span>15h00 - 15h30 <span>Coffee break</span></span></li><li><span><span>15h30 - 16h00 <span><span></span>Antoine Amarilli</span><span> - </span></span></span><i><span><i><span><i><span>Data structures for incremental maintenance of string properties under updates</span></i></span></i></span></i></li><li><span><span><span>16h00 - 16h30 <span>Rayan Chikhi - </span></span></span></span><i><span><i><span><i><span><span> <i>A perspective on current big biological sequence datasets and their search capabilities</i></span><span><b><br></b></span></span></i></span></i></span></i></li></ul></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid185"><span><b>May, 10</b></span></div><span class="gmail-im"><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid142"><ul><li><span>9h00 - 9h45 </span><span>Welcoming coffee</span></li></ul></div></span><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid112"><ul><span class="gmail-im"><li><span>9h45 - 10h45</span><span><b> Keynote</b></span><span>: </span><span>Giulio Ermanno Pibiri </span><span>(HPC-Lab, ISTI-CNR, Pisa, Italy) - <i>On Weighted K-Mer Dictionaries</i></span></li></span><li><span><span><span>10h45 - 11h15 </span>Sven Rahmann and Jens Zentgraf - </span><i><span><i>Finding genetic differences between pig races by efficient parallel k-mer counting using Cuckoo hashing with subtables</i></span></i></span></li><span class="gmail-im"><li><span>11h15h - 11h45 <u>Antoine Limasset</u>, Clément Agret and Bastien Cazaux</span><span> -</span><i><span> Toward optimal fingerprint indexing for large scale genomics</span></i></li><li><span>11h45 - 12h15 <u>Lucas Robidou</u> and Pierre Peterlongo</span><span> -</span><span> <i>Visualization of Bloom Filters and of k -mer sub-query impact</i></span></li></span></ul></div><div id="gmail-m_6375058453968864104gmail-m_554526520772844493gmail-magicdomid167"><ul><li><span>12h15 - 13h45 </span><span>Lunch</span></li></ul></div></div></div></div><div><br></div><div>=================</div><div>VENUE<br></div><div>=================</div><div>Bâtiment ESPRIT, avenue Paul Langevin (next to Polytech Lille) <br></div><div>59650 Villeneuve-d'Ascq</div><div><a href="https://goo.gl/maps/u8uaruhhJxmqR1x67">https://goo.gl/maps/u8uaruhhJxmqR1x67</a></div><div>Quatre cantons Stade P. Mauroy, terminus of the metro line 1 (yellow)<br></div><div><br></div><div><br></div>=================<br>ORGANIZATION COMMITTEE<br>=================<br>* Florent Capelli, Université de Lille<br>* Camille Marchet, CNRS, Lille<br>* Charles Paperman, Université de Lille<br><br>All questions about <span class="gmail-il">TUDASTIC</span> should be emailed to <a href="mailto:tudastic@univ-lille.fr" target="_blank"><span class="gmail-il">tudastic</span>@univ-lille.fr</a><br><br>=================<br>PROGRAM AND STEERING COMMITTEE<br>=================<br>* Camille Marchet, CNRS, Lille<br>* Leena Salmela, University of Helsinki<br>* Florent Capelli, Université de Lille<br>* Charles Paperman, Université de Lille<br>* Blerina Sinaimeri, LUISS University, Rome<br>* Arnaud Mary, Université Claude Bernard Lyon 1<br>* Antoine Limasset, CNRS, Lille<div><div><br></div></div></div>