Main » SPIRE »


International Symposium on String Processing and Information Retrieval (2017)


up

String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings

doi dblp
String Processing and Information Retrieval - 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26-29, 2017, Proceedings

doi dblp
Greedy Shortest Common Superstring Approximation in Compact Space
Jarno Alanko | Tuukka Norri

doi dblp
Longest Common Factor After One Edit Operation
Amihood Amir | Panagiotis Charalampopoulos | Costas S. Iliopoulos | Solon P. Pissis | Jakub Radoszewski

doi dblp
Distinct Squares in Circular Words
Mika Amit | Pawel Gawrychowski

doi dblp
LZ78 Compression in Low Main Memory Space
Diego Arroyuelo | Rodrigo Cánovas | Gonzalo Navarro | Rajeev Raman

doi dblp
On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
Golnaz Badkobeh | Travis Gagie | Shunsuke Inenaga | Tomasz Kociumaka | Dmitry Kosolobov | Simon J. Puglisi

doi dblp
On Suffix Tree Breadth
Golnaz Badkobeh | Juha Kärkkäinen | Simon J. Puglisi | Bella Zhukova

doi dblp
Pattern Matching on Elastic-Degenerate Text with Errors
Giulia Bernardini | Nadia Pisanti | Solon P. Pissis | Giovanna Rosone

doi dblp
Succinct Partial Sums and Fenwick Trees
Philip Bille | Anders Roy Christiansen | Nicola Prezza | Frederik Rye Skjoldjensen

doi dblp
Tight Bounds for Top Tree Compression
Philip Bille | Finn Fernstrøm | Inge Li Gørtz

doi dblp
Efficient Compression and Indexing of Trajectories
Nieves R. Brisaboa | Travis Gagie | Adrián Gómez-Brandón | Gonzalo Navarro | José R. Paramá

doi dblp
Fast Construction of Compressed Web Graphs
Jan Broß | Simon Gog | Matthias Hauck | Marcus Paradies

doi dblp
Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
Cédric Chauve | Mark Jones | Manuel Lafond | Céline Scornavacca | Mathias Weller

doi dblp
Listing Maximal Independent Sets with Minimal Space and Bounded Delay
Alessio Conte | Roberto Grossi | Andrea Marino | Takeaki Uno | Luca Versari

doi dblp
Fast Label Extraction in the CDAWG
Djamal Belazzougui | Fabio Cunial

doi dblp
Lightweight BWT and LCP Merging via the Gap Algorithm
Lavinia Egidi | Giovanni Manzini

doi dblp
Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
Johannes Fischer | Dominik Köppl

doi dblp
Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings
Szymon Grabowski

doi dblp
Mining Bit-Parallel LCS-length Algorithms
Heikki Hyyrö

doi dblp
Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
Shunsuke Kanda | Kazuhiro Morita | Masao Fuketa

doi dblp
Faster Practical Block Compression for Rank/Select Dictionaries
Yusaku Kaneta

doi dblp
Optimal Skeleton Huffman Trees
Shmuel T. Klein | Tamar C. Serebro | Dana Shapira

doi dblp
Detecting One-Variable Patterns
Dmitry Kosolobov | Florin Manea | Dirk Nowotka

doi dblp
Order Preserving Pattern Matching on Trees and DAGs
Temma Nakamura | Shunsuke Inenaga | Hideo Bannai | Masayuki Takeda

doi dblp
A Self-index on Block Trees
Gonzalo Navarro

doi dblp
Counting Palindromes in Substrings
Mikhail Rubinchik | Arseny M. Shur

doi dblp
Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
Takuya Takagi | Keisuke Goto | Yuta Fujishige | Shunsuke Inenaga | Hiroki Arimura