LIPIcs, Volume 128, CPM 2019

• Nadia Pisanti and Solon P. Pissis LIPIcs, Volume 128, CPM'19, Complete Volume 10.4230/LIPIcs.CPM.2019
• Nadia Pisanti and Solon P. Pissis Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.CPM.2019.0
• Paweł Gawrychowski How to Exploit Periodicity (Invited Talk) 10.4230/LIPIcs.CPM.2019.1
• Francesco Dolce, Antonio Restivo, and Christophe Reutenauer Some Variations on Lyndon Words (Invited Talk) 10.4230/LIPIcs.CPM.2019.2
• Michal Ziv-Ukelson Stringology Combats Microbiological Threats (Invited Talk) 10.4230/LIPIcs.CPM.2019.3
• Nicola Prezza Optimal Rank and Select Queries on Dictionary-Compressed Text 10.4230/LIPIcs.CPM.2019.4
• Haitao Jiang, Jiong Guo, Daming Zhu, and Binhai Zhu A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem 10.4230/LIPIcs.CPM.2019.5
• Amihood Amir and Eitan Kondratovsky Sufficient Conditions for Efficient Indexing Under Different Matchings 10.4230/LIPIcs.CPM.2019.6
• Nicola Prezza and Giovanna Rosone Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform 10.4230/LIPIcs.CPM.2019.7
• Niko Kiirala, Leena Salmela, and Alexandru I. Tomescu Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding 10.4230/LIPIcs.CPM.2019.8
• Takaaki Nishimoto and Yasuo Tabei Conversion from RLBWT to LZ77 10.4230/LIPIcs.CPM.2019.9
• Djamal Belazzougui and Fabio Cunial Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs 10.4230/LIPIcs.CPM.2019.10
• Michał Gańczorz Entropy Lower Bounds for Dictionary Compression 10.4230/LIPIcs.CPM.2019.11
• Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, and Marinella Sciortino A New Class of Searchable and Provably Highly Compressible String Transformations 10.4230/LIPIcs.CPM.2019.12
• Dmitry Kosolobov and Nikita Sivukhin Compressed Multiple Pattern Matching 10.4230/LIPIcs.CPM.2019.13
• Karim Labib, Przemysław Uznański, and Daniel Wolleb-Graf Hamming Distance Completeness 10.4230/LIPIcs.CPM.2019.14
• Jan Studený and Przemysław Uznański Approximating Approximate Pattern Matching 10.4230/LIPIcs.CPM.2019.15
• Sung Gwan Park, Amihood Amir, Gad M. Landau, and Kunsoo Park Cartesian Tree Matching and Indexing 10.4230/LIPIcs.CPM.2019.16
• Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, and Marcin Pia̧tkowski Indexing the Bijective BWT 10.4230/LIPIcs.CPM.2019.17
• Julian Pape-Lange On Maximal Repeats in Compressed Strings 10.4230/LIPIcs.CPM.2019.18
• Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, and Brigitte Vallée Dichotomic Selection on Words: A Probabilistic Analysis 10.4230/LIPIcs.CPM.2019.19
• Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, and Stéphane Vialette Finding a Small Number of Colourful Components 10.4230/LIPIcs.CPM.2019.20
• Paweł Gawrychowski and Tatiana Starikovskaya Streaming Dictionary Matching with Mismatches 10.4230/LIPIcs.CPM.2019.21
• Paweł Gawrychowski, Jakub Radoszewski, and Tatiana Starikovskaya Quasi-Periodicity in Streams 10.4230/LIPIcs.CPM.2019.22
• Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda Computing Runs on a Trie 10.4230/LIPIcs.CPM.2019.23
• Bastien Cazaux and Eric Rivals Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding 10.4230/LIPIcs.CPM.2019.24
• Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszyński, Tomasz Waleń, and Wiktor Zuba Quasi-Linear-Time Algorithm for Longest Common Circular Factor 10.4230/LIPIcs.CPM.2019.25
• Diego Díaz-Domínguez, Travis Gagie, and Gonzalo Navarro Simulating the DNA Overlap Graph in Succinct Space 10.4230/LIPIcs.CPM.2019.26
• Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda Faster Queries for Longest Substring Palindrome After Block Edit 10.4230/LIPIcs.CPM.2019.27
• Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, and Murray Patterson A Rearrangement Distance for Fully-Labelled Trees 10.4230/LIPIcs.CPM.2019.28
• Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, and Masayuki Takeda On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations 10.4230/LIPIcs.CPM.2019.29
• Diptarama Hendrian, Takuya Takagi, and Shunsuke Inenaga Online Algorithms for Constructing Linear-Size Suffix Trie 10.4230/LIPIcs.CPM.2019.30
• Oleg Merkurev and Arseny M. Shur Searching Long Repeats in Streams 10.4230/LIPIcs.CPM.2019.31
• Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, and Simon J. Puglisi Computing the Antiperiod(s) of a String 10.4230/LIPIcs.CPM.2019.32