LEADER 04655nam 22007695 450 001 996465981203316 005 20230221182620.0 010 $a3-319-67428-5 024 7 $a10.1007/978-3-319-67428-5 035 $a(CKB)4100000000587152 035 $a(DE-He213)978-3-319-67428-5 035 $a(MiAaPQ)EBC6301320 035 $a(MiAaPQ)EBC5577965 035 $a(Au-PeEL)EBL5577965 035 $a(OCoLC)1004424528 035 $a(PPN)204533686 035 $a(EXLCZ)994100000000587152 100 $a20170905d2017 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aString Processing and Information Retrieval$b[electronic resource] $e24th International Symposium, SPIRE 2017, Palermo, Italy, September 26?29, 2017, Proceedings /$fedited by Gabriele Fici, Marinella Sciortino, Rossano Venturini 205 $a1st ed. 2017. 210 1$aCham :$cSpringer International Publishing :$cImprint: Springer,$d2017. 215 $a1 online resource (XIX, 318 p. 65 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10508 311 $a3-319-67427-7 327 $aGreedy 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. . 330 $aThis 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. . 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v10508 606 $aInformation storage and retrieval systems 606 $aElectronic data processing?Management 606 $aInformation technology?Management 606 $aArtificial intelligence 606 $aDatabase management 606 $aComputer vision 606 $aInformation Storage and Retrieval 606 $aIT Operations 606 $aComputer Application in Administrative Data Processing 606 $aArtificial Intelligence 606 $aDatabase Management 606 $aComputer Vision 615 0$aInformation storage and retrieval systems. 615 0$aElectronic data processing?Management. 615 0$aInformation technology?Management. 615 0$aArtificial intelligence. 615 0$aDatabase management. 615 0$aComputer vision. 615 14$aInformation Storage and Retrieval. 615 24$aIT Operations. 615 24$aComputer Application in Administrative Data Processing. 615 24$aArtificial Intelligence. 615 24$aDatabase Management. 615 24$aComputer Vision. 676 $a005.746 702 $aFici$b Gabriele$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSciortino$b Marinella$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aVenturini$b Rossano$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a996465981203316 996 $aString Processing and Information Retrieval$92569423 997 $aUNISA