Front Matter ....Pages I-XIX
Greedy Shortest Common Superstring Approximation in Compact Space (Jarno Alanko, Tuukka Norri)....Pages 1-13
Longest Common Factor After One Edit Operation (Amihood Amir, Panagiotis Charalampopoulos, Costas S. Iliopoulos, Solon P. Pissis, Jakub Radoszewski)....Pages 14-26
Distinct Squares in Circular Words (Mika Amit, Paweł Gawrychowski)....Pages 27-37
LZ78 Compression in Low Main Memory Space (Diego Arroyuelo, Rodrigo Cánovas, Gonzalo Navarro, Rajeev Raman)....Pages 38-50
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation (Golnaz Badkobeh, Travis Gagie, Shunsuke Inenaga, Tomasz Kociumaka, Dmitry Kosolobov, Simon J. Puglisi)....Pages 51-67
On Suffix Tree Breadth (Golnaz Badkobeh, Juha Kärkkäinen, Simon J. Puglisi, Bella Zhukova)....Pages 68-73
Pattern Matching on Elastic-Degenerate Text with Errors (Giulia Bernardini, Nadia Pisanti, Solon P. Pissis, Giovanna Rosone)....Pages 74-90
Succinct Partial Sums and Fenwick Trees (Philip Bille, Anders Roy Christiansen, Nicola Prezza, Frederik Rye Skjoldjensen)....Pages 91-96
Tight Bounds for Top Tree Compression (Philip Bille, Finn Fernstrøm, Inge Li Gørtz)....Pages 97-102
Efficient Compression and Indexing of Trajectories (Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá)....Pages 103-115
Fast Construction of Compressed Web Graphs (Jan Broß, Simon Gog, Matthias Hauck, Marcus Paradies)....Pages 116-128
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract) (Cedric Chauve, Mark Jones, Manuel Lafond, Céline Scornavacca, Mathias Weller)....Pages 129-143
Listing Maximal Independent Sets with Minimal Space and Bounded Delay (Alessio Conte, Roberto Grossi, Andrea Marino, Takeaki Uno, Luca Versari)....Pages 144-160
Fast Label Extraction in the CDAWG (Djamal Belazzougui, Fabio Cunial)....Pages 161-175
Lightweight BWT and LCP Merging via the Gap Algorithm (Lavinia Egidi, Giovanni Manzini)....Pages 176-190
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries (Johannes Fischer, Dominik Köppl)....Pages 191-207
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings (Szymon Grabowski)....Pages 208-213
Mining Bit-Parallel LCS-length Algorithms (Heikki Hyyrö)....Pages 214-220
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries (Shunsuke Kanda, Kazuhiro Morita, Masao Fuketa)....Pages 221-233
Faster Practical Block Compression for Rank/Select Dictionaries (Yusaku Kaneta)....Pages 234-240
Optimal Skeleton Huffman Trees (Shmuel T. Klein, Tamar C. Serebro, Dana Shapira)....Pages 241-253
Detecting One-Variable Patterns (Dmitry Kosolobov, Florin Manea, Dirk Nowotka)....Pages 254-270
Order Preserving Pattern Matching on Trees and DAGs (Temma Nakamura, Shunsuke Inenaga, Hideo Bannai, Masayuki Takeda)....Pages 271-277
A Self-index on Block Trees (Gonzalo Navarro)....Pages 278-289
Counting Palindromes in Substrings (Mikhail Rubinchik, Arseny M. Shur)....Pages 290-303
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression (Takuya Takagi, Keisuke Goto, Yuta Fujishige, Shunsuke Inenaga, Hiroki Arimura)....Pages 304-316
Back Matter ....Pages 317-318