Muutke küpsiste eelistusi

String Processing and Information Retrieval: 29th International Symposium, SPIRE 2022, Concepción, Chile, November 810, 2022, Proceedings 1st ed. 2022 [Pehme köide]

Edited by , Edited by
  • Formaat: Paperback / softback, 332 pages, kõrgus x laius: 235x155 mm, kaal: 539 g, 41 Illustrations, color; 25 Illustrations, black and white; XVII, 332 p. 66 illus., 41 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13617
  • Ilmumisaeg: 01-Nov-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031206428
  • ISBN-13: 9783031206429
Teised raamatud teemal:
  • Pehme köide
  • Hind: 71,86 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Tavahind: 84,54 €
  • Säästad 15%
  • Raamatu kohalejõudmiseks kirjastusest kulub orienteeruvalt 2-4 nädalat
  • Kogus:
  • Lisa ostukorvi
  • Tasuta tarne
  • Tellimisaeg 2-4 nädalat
  • Lisa soovinimekirja
String Processing and Information Retrieval: 29th International Symposium, SPIRE 2022, Concepción, Chile, November 810, 2022, Proceedings 1st ed. 2022Suurem pilt
  • Formaat: Paperback / softback, 332 pages, kõrgus x laius: 235x155 mm, kaal: 539 g, 41 Illustrations, color; 25 Illustrations, black and white; XVII, 332 p. 66 illus., 41 illus. in color., 1 Paperback / softback
  • Sari: Lecture Notes in Computer Science 13617
  • Ilmumisaeg: 01-Nov-2022
  • Kirjastus: Springer International Publishing AG
  • ISBN-10: 3031206428
  • ISBN-13: 9783031206429
Teised raamatud teemal:
Püsilink: https://www.kriso.ee/db/9783031206429.html
Märksõnad:
This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held in Concepción, Chile, in November 2022. The 23 full papers presented in this volume were carefully reviewed and selected from 43 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.
String Algorithms.- Subsequence Covers of Words.- Maximal Closed
Substrings.- Online Algorithms for Finding Distinct Substrings with Length
and Multiple Prefix and Suffx Conditions.- The Complexity of the
Co-Occurrence Problem.- Reconstructing Parameterized Strings from
Parameterized Suffx and LCP Arrays.- Computing the Parameterized
BurrowsWheeler Transform Online.- Accessing the Suffx Array via 1
Forest.- On the Optimisation of the GSACA Suffx Array Construction
Algorithm.- String Compression.- Balancing Run-Length Straight-Line
Programs.- Substring Complexities on Run-length Compressed Strings.-
Information Retrieval.- How TrainTest Leakage Affects Zero-shot Retrieval.-
Computational Biology.- Genome Comparison on Succinct Colored de Bruijn
Graphs.- Sorting Genomes by Prefix Double-Cut-and-Joins.- KATKA: A
KRAKEN-like Tool with k Given at Query Time.- Computing all-vs-all MEMs in
Run-Length-Encoded Collections of HiFi Reads.- Space-Effcient Data
Structures.- Internal Masked Prefix Sums and Its Connection to Fully Internal
Measurement Queries.- Compressed String Dictionaries via Data-Aware Subtrie
Compaction.- On representing the Degree Sequences of Sublogarithmic-Degree
Wheeler Graphs.- Engineering Compact Data Structures for Rank and Select
Queries on Bit Vectors.- Pattern Matching in Strings, Graphs, and Trees.-
Matching Patterns with Variables Under Edit Distance.- On the Hardness of
Computing the Edit Distance of Shallow Trees.- Quantum Time Complexity and
Algorithms for Pattern Matching on Labeled Graphs.- Pattern Matching under
DTW Distance.