String Processing and Information Retrieval  30th International Symposium, SPIRE 2023, Pisa, Italy, September 26-28, 2023, Proceedings /  [electronic resource] : 
edited by Franco Maria Nardini, Nadia Pisanti, Rossano Venturini. 
 - 1st ed. 2023. 
 - XIX, 394 p. 60 illus., 41 illus. in color.  online resource. 
 - Lecture Notes in Computer Science,  14240  1611-3349 ; .
 - Lecture Notes in Computer Science,  14240 .
<br/><br/>Longest 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. 
<br/><br/> This 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. 
<br/><br/><label>ISBN: </label>9783031439803 
<br/><br/><label>Standard No.: </label>10.1007/978-3-031-43980-3  doi 
<br/><br/><label>Subjects--Topical Terms: </label><br/>Algorithms.<br/>Computer engineering.<br/>Computer networks .<br/>Artificial intelligence.<br/>Data structures (Computer science).<br/>Information theory.<br/>Numerical analysis.<br/>Algorithms.<br/>Design and Analysis of Algorithms.<br/>Computer Engineering and Networks.<br/>Artificial Intelligence.<br/>Data Structures and Information Theory.<br/>Numerical Analysis.
<br/><br/><label>LC Class. No.: </label>QA76.9.A43 
<br/><br/><label>Dewey Class. No.: </label>518.1