CPM B

34 papers

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