Del 13617 i serien Lecture Notes in Computer Science

String Processing and Information Retrieval

29th International Symposium, SPIRE 2022, Concepción, Chile, November 8–10, 2022, Proceedings

Häftad, Engelska, 2022

1 069 kr

Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt för medlemmar vid köp för minst 249 kr.

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. information retrieval;

Produktinformation

Utgivningsdatum2022-11-01
Mått155 x 235 x 22 mm
Vikt538 g
FormatHäftad
SpråkEngelska
SerieLecture Notes in Computer Science
Antal sidor332
FörlagSpringer International Publishing AG
ISBN9783031206429

Tillhör följande kategorier

Systemvetenskap och AI inom Data och IT
Programmeringsböcker inom Data och IT
Hårdvara inom Data och IT
Referensverk och tvärvetenskap inom Samhälle och politik

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 Burrows–Wheeler 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 Train–Test 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.