String Processing and Information Retrieval

30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings

AvFranco Maria Nardini,Nadia Pisanti

Häftad, Engelska, 2023

Del 14240 i serien Lecture Notes in Computer Science

837 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

Beskrivning

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;

Produktinformation

Utgivningsdatum:2023-09-20
Mått:155 x 235 x 23 mm
Vikt:628 g
Format:Häftad
Språk:Engelska
Serie:Lecture Notes in Computer Science
Antal sidor:394
Förlag:Springer International Publishing AG
ISBN:9783031439797

Utforska kategorier

Systemvetenskap och AI inom Data och IT
Artificiell intelligens inom Data och IT
Hårdvara inom Data och IT

Innehållsförteckning

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.