Atjaunināt sīkdatņu piekrišanu

String Processing and Information Retrieval: 28th International Symposium, SPIRE 2021, Lille, France, October 46, 2021, Proceedings 1st ed. 2021 [Mīkstie vāki]

Edited by , Edited by
  • Formāts: Paperback / softback, 255 pages, height x width: 235x155 mm, weight: 415 g, 29 Illustrations, color; 18 Illustrations, black and white; X, 255 p. 47 illus., 29 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12944
  • Izdošanas datums: 28-Sep-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030866912
  • ISBN-13: 9783030866914
Citas grāmatas par šo tēmu:
  • Mīkstie vāki
  • Cena: 60,29 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Standarta cena: 70,94 €
  • 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: 28th International Symposium, SPIRE 2021, Lille, France, October 46, 2021, Proceedings 1st ed. 2021Palielināt
  • Formāts: Paperback / softback, 255 pages, height x width: 235x155 mm, weight: 415 g, 29 Illustrations, color; 18 Illustrations, black and white; X, 255 p. 47 illus., 29 illus. in color., 1 Paperback / softback
  • Sērija : Lecture Notes in Computer Science 12944
  • Izdošanas datums: 28-Sep-2021
  • Izdevniecība: Springer Nature Switzerland AG
  • ISBN-10: 3030866912
  • ISBN-13: 9783030866914
Citas grāmatas par šo tēmu:
Permanent link: https://www.kriso.lv/db/9783030866914.html
Keywords:
This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.*The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.





*The symposium was held virtually.
Invited papers.- r-indexing the eBWT.- Unicode at Gigabytes per Second.- Combinatorics.- Longest Common Rollercoasters.- Minimal unique palindromic substrings after single-character substitution.- Permutation-constrained Common String Partitions with Applications.- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent.- String Covers of a Tree.- Compression.- Grammar Index By Induced Suffix Sorting.- An LMS-based Grammar Self-index with Local Consistency Properties.- On the approximation ratio of LZ-End to LZ77.- Data Structures.- Computing the original eBWT faster, simpler, and with less memory.- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree.- findere: fast and precise approximate membership query.- Repeats.- Improved Topic Modeling in Twitter through Community Pooling.- Lower Bounds for the Number of Repetitions in 2D Strings.- On Stricter Reachable Repetitiveness Measures.- Information Retrieval.- Improved Topic modeling in Twitter through Community Pooling.- TSXor: A Simple Time Series Compression Algorithm.- Pattern Matching.- Exploiting Pseudo-Locality of Interchange Distance.- Position Heaps for Cartesian-tree Matching on Strings and Tries.