Greedy shortest common superstring approximation in compact space -- Longest common factor after one edit operation -- Distinct squares in circular words -- LZ78 Compression in Low Main Memory Space -- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.-On suffix tree breadth -- Pattern Matching on Elastic-Degenerate Text with Errors -- Succint Partial Sums and Fenwick Trees -- Tight Bounds for Top Tree Compression -- Efficient Compression and Indexing of Trajectories -- Fast Construction of Compressed Web Graphs -- Constructing a Consensus Phylogeny from a Leaf-Removal Distance -- Listing Maximal Independent Sets with Minimal Space and Bounded Delay -- Fast label extraction in the CDAWG -- Lightweight BWT and LCP Merging via the Gap algorithm -- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries -- Regular Abelian periods and longest common Abelian factors on run-length encoded strings.-Mining bit-parallel LCS-length algorithms -- Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries -- Faster Practical Block Compression for Rank/Select Dictionaries -- Optimal Skeleton Huffman Trees -- Detecting Unary Patterns -- Order preserving pattern matching on trees and DAGs -- A Self-Index on Block Trees -- Counting Palindromes in Substrings -- linear-size CDAWG: new repetition-aware indexing and grammar compression
Summary
This book constitutes the proceedings of the 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, held in Palermo, Italy, in September 2017. The 26 papers presented in this volume were carefully reviewed and selected from 71 submissions. They focus on fundamental studies on string processing and information retrieval, as well as on computational biology
Notes
International conference proceedings
Bibliography
Includes bibliographical references and author index
Notes
Online resource; title from PDF title page (SpringerLink, viewed September 21, 2017)
