Atjaunināt sīkdatņu piekrišanu

String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 2628, 2023, Proceedings 1st ed. 2023 [Mīkstie vāki]

Edited by , Edited by , Edited by
  • Formāts: Paperback / softback, 394 pages, height x width: 235x155 mm, weight: 635 g, 41 Illustrations, color; 19 Illustrations, black and white; XIX, 394 p. 60 illus., 41 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 14240
  • Izdošanas datums: 20-Sep-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031439791
  • ISBN-13: 9783031439797
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 69,22 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 81,44 €
  • Ietaupiet 15%
  • Grāmatu piegādes laiks ir 3-4 nedēļas, ja grāmata ir uz vietas izdevniecības noliktavā. Ja izdevējam nepieciešams publicēt jaunu tirāžu, grāmatas piegāde var aizkavēties.
  • Daudzums:
  • Ielikt grozā
  • Piegādes laiks - 4-6 nedēļas
  • Pievienot vēlmju sarakstam
String Processing and Information Retrieval: 30th International Symposium, SPIRE 2023, Pisa, Italy, September 2628, 2023, Proceedings 1st ed. 2023Palielināt
  • Formāts: Paperback / softback, 394 pages, height x width: 235x155 mm, weight: 635 g, 41 Illustrations, color; 19 Illustrations, black and white; XIX, 394 p. 60 illus., 41 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 14240
  • Izdošanas datums: 20-Sep-2023
  • Izdevniecība: Springer International Publishing AG
  • ISBN-10: 3031439791
  • ISBN-13: 9783031439797
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783031439797.html
Keywords:
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 2628, 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.
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.