Cantitate/Preț
Produs
Total produse
Vezi coșul
String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings de Franco Maria Nardini

String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 26–28, 2023, Proceedings: Lecture Notes in Computer Science, cartea 14240

Editat de Franco Maria Nardini, Nadia Pisanti, Rossano Venturini
en Limba Engleză Paperback – 20 sep 2023
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.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 44888 lei

Preț vechi: 56110 lei
-20% Nou

Puncte Express: 673
Preț estimativ în valută:
8596€ • 8772$ • 7232£

Carte tipărită la comandă

Livrare economică 26 februarie-12 martie

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783031439797
ISBN-10: 3031439791
Pagini: 394
Ilustrații: XIX, 394 p. 60 illus., 41 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.58 kg
Ediția:1st ed. 2023
Editura: Springer Nature Switzerland
Colecția Springer
Seria Lecture Notes in Computer Science

Locul publicării:Cham, Switzerland

Cuprins

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.