LEADER 04899nam 22007815 450 001 9910746292503321 005 20251225210824.0 010 $a9783031439803 010 $a3031439805 024 7 $a10.1007/978-3-031-43980-3 035 $a(CKB)28269929500041 035 $a(MiAaPQ)EBC30749697 035 $a(Au-PeEL)EBL30749697 035 $a(OCoLC)1399167412 035 $a(DE-He213)978-3-031-43980-3 035 $a(EXLCZ)9928269929500041 100 $a20230919d2023 u| 0 101 0 $aeng 135 $aurcnu|||||||| 181 $ctxt$2rdacontent 182 $cc$2rdamedia 183 $acr$2rdacarrier 200 10$aString Processing and Information Retrieval $e30th International Symposium, SPIRE 2023, Pisa, Italy, September 26?28, 2023, Proceedings /$fedited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini 205 $a1st ed. 2023. 210 1$aCham :$cSpringer Nature Switzerland :$cImprint: Springer,$d2023. 215 $a1 online resource (409 pages) 225 1 $aLecture Notes in Computer Science,$x1611-3349 ;$v14240 311 08$a9783031439797 327 $aLongest Common Prefix Arrays for Succinct k-Spectra -- On Suffix Tree Detection -- Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph -- Evaluating Regular Path Queries on Compressed Adjacency Matrices -- Approximate Cartesian Tree Matching: an Approach Using Swaps -- Optimal Wheeler Language Recognition -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem -- Compressibility Measures for Two-dimensional Data -- From De Bruijn Graphs to Variation Graphs - Relationships between Pangenome Models -- CAGE: Cache-Aware Graphlet Enumeration -- Space-time Trade-offs for the LCP Array of Wheeler DFAs -- Computing all-vs-all MEMs in Grammar-compressed Text -- Sublinear Time Lempel-Ziv (LZ77) Factorization -- New Advances in Rightmost Lempel-Ziv -- Engineering a Textbook Approach to Index Massive String Dictionaries -- Count-min Sketch with Variable Number of Hash Functions: an Experimental Study -- Dynamic Compact Planar Embeddings -- A Simple Grammar-based Index for Finding Approximately Longest Common Substrings -- On the Number of Factors in the LZ-End Factorization -- Non-Overlapping Indexing in BWT-runs Bounded Space -- Efficient Parameterized Pattern Matching in Sublinear Space -- Largest Repetition Factorization of Fibonacci Words -- String Covers of a Tree Revisited -- Compacting Massive Public Transport Data -- Constant Time and Space Updates for the Sigma-Tau Problem -- Generalized Minimal Absent Words of Multiple Strings -- Frequency-Constrained Substring Complexity -- Chaining of Maximal Exact Matches in Graphs -- Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems -- Binary Mixed-digit Data Compression Codes. 330 $aThis volume LNCS 14240 constitutes the refereed proceedings of the 30th International Symposium on String Processing and Information Retrieval, SPIRE 2023, held in Pisa, Italy, during September 26?28, 2023. The 31 full papers presented were carefully reviewed and selected from 47 submissions. They cover topics such as: data structures; algorithms; constrained Substring complexity; data compression codes; succinct k-spectra; and LCP array of wheeler DFAs. 410 0$aLecture Notes in Computer Science,$x1611-3349 ;$v14240 606 $aAlgorithms 606 $aComputer engineering 606 $aComputer networks 606 $aArtificial intelligence 606 $aData structures (Computer science) 606 $aInformation theory 606 $aNumerical analysis 606 $aAlgorithms 606 $aDesign and Analysis of Algorithms 606 $aComputer Engineering and Networks 606 $aArtificial Intelligence 606 $aData Structures and Information Theory 606 $aNumerical Analysis 615 0$aAlgorithms. 615 0$aComputer engineering. 615 0$aComputer networks. 615 0$aArtificial intelligence. 615 0$aData structures (Computer science) 615 0$aInformation theory. 615 0$aNumerical analysis. 615 14$aAlgorithms. 615 24$aDesign and Analysis of Algorithms. 615 24$aComputer Engineering and Networks. 615 24$aArtificial Intelligence. 615 24$aData Structures and Information Theory. 615 24$aNumerical Analysis. 676 $a005.74 700 $aNardini$b Franco Maria$01429386 701 $aPisanti$b Nadia$01429387 701 $aVenturini$b Rossano$0721173 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910746292503321 996 $aString Processing and Information Retrieval$93568344 997 $aUNINA