default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID30th CPM 2019: Pisa, Italy
- Nadia Pisanti
, Solon P. Pissis:
30th Annual Symposium on Combinatorial Pattern Matching, CPM 2019, Pisa, Italy, June 18-20, 2019. LIPIcs 128, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2019, ISBN 978-3-95977-103-0 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:18
- Pawel Gawrychowski:
How to Exploit Periodicity (Invited Talk). 1:1-1:1 - Francesco Dolce, Antonio Restivo, Christophe Reutenauer:
Some Variations on Lyndon Words (Invited Talk). 2:1-2:14 - Michal Ziv-Ukelson:
Stringology Combats Microbiological Threats (Invited Talk). 3:1-3:1 - Nicola Prezza:
Optimal Rank and Select Queries on Dictionary-Compressed Text. 4:1-4:12 - Haitao Jiang, Jiong Guo, Daming Zhu, Binhai Zhu:
A 2-Approximation Algorithm for the Complementary Maximal Strip Recovery Problem. 5:1-5:13 - Amihood Amir, Eitan Kondratovsky:
Sufficient Conditions for Efficient Indexing Under Different Matchings. 6:1-6:12 - Nicola Prezza, Giovanna Rosone:
Space-Efficient Computation of the LCP Array from the Burrows-Wheeler Transform. 7:1-7:18 - Niko Kiirala, Leena Salmela, Alexandru I. Tomescu:
Safe and Complete Algorithms for Dynamic Programming Problems, with an Application to RNA Folding. 8:1-8:16 - Takaaki Nishimoto, Yasuo Tabei:
Conversion from RLBWT to LZ77. 9:1-9:12 - Djamal Belazzougui, Fabio Cunial:
Fully-Functional Bidirectional Burrows-Wheeler Indexes and Infinite-Order De Bruijn Graphs. 10:1-10:15 - Michal Ganczorz:
Entropy Lower Bounds for Dictionary Compression. 11:1-11:18 - Raffaele Giancarlo, Giovanni Manzini, Giovanna Rosone, Marinella Sciortino:
A New Class of Searchable and Provably Highly Compressible String Transformations. 12:1-12:12 - Dmitry Kosolobov, Nikita Sivukhin:
Compressed Multiple Pattern Matching. 13:1-13:14 - Karim Labib, Przemyslaw Uznanski, Daniel Wolleb-Graf:
Hamming Distance Completeness. 14:1-14:17 - Jan Studený, Przemyslaw Uznanski:
Approximating Approximate Pattern Matching. 15:1-15:13 - Sung Gwan Park, Amihood Amir, Gad M. Landau, Kunsoo Park:
Cartesian Tree Matching and Indexing. 16:1-16:14 - Hideo Bannai, Juha Kärkkäinen, Dominik Köppl, Marcin Piatkowski:
Indexing the Bijective BWT. 17:1-17:14 - Julian Pape-Lange:
On Maximal Repeats in Compressed Strings. 18:1-18:13 - Ali Akhavi, Julien Clément, Dimitri Darthenay, Loïck Lhote, Brigitte Vallée:
Dichotomic Selection on Words: A Probabilistic Analysis. 19:1-19:19 - Laurent Bulteau, Konrad K. Dabrowski, Guillaume Fertin, Matthew Johnson, Daniël Paulusma, Stéphane Vialette:
Finding a Small Number of Colourful Components. 20:1-20:14 - Pawel Gawrychowski, Tatiana Starikovskaya:
Streaming Dictionary Matching with Mismatches. 21:1-21:15 - Pawel Gawrychowski, Jakub Radoszewski, Tatiana Starikovskaya:
Quasi-Periodicity in Streams. 22:1-22:14 - Ryo Sugahara, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Computing Runs on a Trie. 23:1-23:11 - Bastien Cazaux, Eric Rivals:
Linking BWT and XBW via Aho-Corasick Automaton: Applications to Run-Length Encoding. 24:1-24:20 - Mai Alzamel, Maxime Crochemore, Costas S. Iliopoulos, Tomasz Kociumaka, Jakub Radoszewski, Wojciech Rytter, Juliusz Straszynski, Tomasz Walen, Wiktor Zuba:
Quasi-Linear-Time Algorithm for Longest Common Circular Factor. 25:1-25:14 - Diego Díaz-Domínguez, Travis Gagie, Gonzalo Navarro:
Simulating the DNA Overlap Graph in Succinct Space. 26:1-26:20 - Mitsuru Funakoshi, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
Faster Queries for Longest Substring Palindrome After Block Edit. 27:1-27:13 - Giulia Bernardini, Paola Bonizzoni, Gianluca Della Vedova, Murray Patterson:
A Rearrangement Distance for Fully-Labelled Trees. 28:1-28:15 - Yuki Urabe, Yuto Nakashima, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda:
On the Size of Overlapping Lempel-Ziv and Lyndon Factorizations. 29:1-29:11 - Diptarama Hendrian, Takuya Takagi, Shunsuke Inenaga:
Online Algorithms for Constructing Linear-Size Suffix Trie. 30:1-30:19 - Oleg Merkurev, Arseny M. Shur:
Searching Long Repeats in Streams. 31:1-31:14 - Hayam Alamro, Golnaz Badkobeh, Djamal Belazzougui, Costas S. Iliopoulos, Simon J. Puglisi:
Computing the Antiperiod(s) of a String. 32:1-32:11
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2026-05-01 23:23 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
