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

• Συγγραφή απο Οργανισμό/Αρχή: SpringerLink (Online service)
• Άλλοι συγγραφείς: Fici, Gabriele (Επιμελητής έκδοσης), Sciortino, Marinella (Επιμελητής έκδοσης), Venturini, Rossano (Επιμελητής έκδοσης)
• Μορφή: Ηλεκτρονική πηγή Ηλ. βιβλίο
• Γλώσσα: English
• Έκδοση: Cham : Springer International Publishing : Imprint: Springer, 2017.
• Σειρά: Lecture Notes in Computer Science, 10508
• Θέματα: Computer science.; Database management.; Information storage and retrieval.; Artificial intelligence.; Image processing.; Application software.; Management information systems.; Computer Science.; Information Storage and Retrieval.; Management of Computing and Information Systems.; Computer Appl. in Administrative Data Processing.; Artificial Intelligence (incl. Robotics).; Database Management.; Image Processing and Computer Vision.

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...

Πίνακας περιεχομένων:

• 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. .