<html>
<head>
<meta http-equiv="content-type" content="text/html; charset=UTF-8">
</head>
<body text="#000000" bgcolor="#FFFFFF">
<div class="moz-text-html" lang="x-unicode">
==============================<br>
<div class="moz-forward-container"> === <b>CPM 2019 Call for
PARTICIPATION</b> ===<br>
==============================<br>
30th Annual Symposium on Combinatorial Pattern Matching<br>
Pisa, Italy, June 18-20, 2019<br>
<a class="moz-txt-link-freetext"
href="http://cpm2019.di.unipi.it/">http://cpm2019.di.unipi.it/</a><br>
<br>
<b>REGISTRATION</b> is open:<br>
<a class="moz-txt-link-freetext"
href="http://cpm2019.di.unipi.it/registration/">http://cpm2019.di.unipi.it/registration/</a><b><br>
<br>
KEYNOTE SPEAKERS</b><br>
<br>
Paweł Gawrychowski (University of Wrocław, Poland)
<br>
How to exploit periodicity
<br>
<br>
Antonio Restivo (University of Palermo, Italy) <br>
Some variations on Lyndon words<br>
<br>
Michal Ziv-Ukelson (Ben Gurion University of the Negev, Israel)<br>
Stringology combats microbiological threats<br>
<br>
<b>HIGHLIGHT SPEAKERS</b><br>
[the Highlights of CPM is a special session introduced in this
CPM edition, for presenting the highlights of recent
developments in combinatorial pattern matching]<br>
<br>
Diptarka Chakraborty (Weizmann Institute of Science, Israel)<br>
Approximating edit distance within constant factor in truly
sub-quadratic time (FOCS 2018)<br>
<br>
Nicola Prezza (University of Pisa, Italy)<br>
At the roots of dictionary compression: string attractors (STOC
2018) <br>
<br>
<b>ACCEPTED PAPERS </b><br>
[<a class="moz-txt-link-freetext"
href="http://cpm2019.di.unipi.it/accepted/">http://cpm2019.di.unipi.it/accepted/</a>]<br>
<br>
Haitao Jiang, Jiong Guo, Daming Zhu and Binhai Zhu. <br>
A 2-Approximation Algorithm for the Complementary Maximal Strip
Recovery Problem<br>
<br>
Eitan Kondratovsky and Amihood Amir. <br>
Sufficient Conditions for Efficient Indexing under Different
Matchings<br>
<br>
Nicola Prezza and Giovanna Rosone. <br>
Space-Efficient Computation of the LCP Array from the
Burrows-Wheeler Transform<br>
<br>
Niko Kiirala, Leena Salmela and Alexandru I. Tomescu. <br>
Safe and complete algorithms for dynamic programming problems,
with an application to RNA folding<br>
<br>
Takaaki Nishimoto and Yasuo Tabei. <br>
Conversion from RLBWT to LZ77<br>
<br>
Djamal Belazzougui and Fabio Cunial. <br>
Fully-functional bidirectional Burrows-Wheeler indexes<br>
<br>
Michał Gańczorz. <br>
Entropy lower bounds for dictionary compression<br>
<br>
Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone and
Marinella Sciortino. <br>
A New Class of Searchable and Provably Highly Compressible
String Transformations<br>
<br>
Dmitry Kosolobov and Nikita Sivukhin. <br>
Compressed Multiple Pattern Matching<br>
<br>
Karim Labib, Przemysław Uznański and Daniel Wolleb-Graf. <br>
Hamming distance completeness<br>
<br>
Jan Studený and Przemysław Uznański. <br>
Approximating Approximate Pattern Matching<br>
<br>
Sung Gwan Park, Amihood Amir, Gad M. Landau and Kunsoo Park. <br>
Cartesian Tree Matching and Indexing<br>
<br>
Nicola Prezza. <br>
Optimal Rank and Select Queries on Dictionary-Compressed Text<br>
<br>
Hideo Bannai, Juha Kärkkäinen, Dominik Köppl and Marcin
Piątkowski. <br>
Indexing the Bijective BWT<br>
<br>
Julian Pape-Lange. <br>
On Maximal Repeats in Compressed Strings<br>
<br>
Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote and
Brigitte Vallee. <br>
Dichotomic selection on words: a probabilistic analysis<br>
<br>
Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S.
Iliopoulos and Simon J. Puglisi. <br>
Computing the Antiperiod(s) of a String<br>
<br>
Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew
Johnson, Daniel Paulusma and Stephane Vialette.<br>
Finding a Small Number of Colourful Components<br>
<br>
Pawel Gawrychowski and Tatiana Starikovskaya. <br>
Streaming dictionary matching with mismatches<br>
<br>
Pawel Gawrychowski, Jakub Radoszewski and Tatiana Starikovskaya.
<br>
Quasi-periodicity in streams<br>
<br>
Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and
Masayuki Takeda. <br>
Computing runs on a trie<br>
<br>
Bastien Cazaux and Eric Rivals. <br>
Linking BWT and XBW via Aho-Corasick automaton: applications to
Run-Length Encoding<br>
<br>
Mai Alzamel, Maxime Crochemore, Costas Iliopoulos, Tomasz
Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz
Straszyński, Tomasz Waleń and Wiktor Zuba. <br>
Quasi-Linear-Time Algorithm for Longest Common Circular Factor<br>
<br>
Diego Diaz-Dominguez, Travis Gagie and Gonzalo Navarro. <br>
Simulating the DNA string graph in succinct space<br>
<br>
Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo
Bannai and Masayuki Takeda. <br>
Faster queries for longest substring palindrome after block edit<br>
<br>
Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova and
Murray Patterson. <br>
A rearrangement distance for fully-labelled trees<br>
<br>
Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai and
Masayuki Takeda. <br>
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations<br>
<br>
Diptarama Hendrian, Takuya Takagi and Shunsuke Inenaga. <br>
Online Algorithms for Constructing Linear-size Suffix Trie<br>
<br>
Oleg Merkurev and Arseny Shur. <br>
Searching Long Repeats in Streams<br>
<br>
WE LOOK FORWARD TO SEE YOU IN PISA!!!<br>
<br>
Nadia Pisanti and Solon Pissis<br>
</div>
</div>
</body>
</html>