Isbn: 9783031206429 - string processing and information retrieval: 29th international symposium, spire 2022, concepción, chile, november 8–10, 2022, proceedings: 13617 (lecture notes in computer science) (14 resultados)

Condición: New.

Paperback. Condición: New.

Condición: New. In English.

Condición: New. 1st ed. 2022 edition NO-PA16APR2015-KAP.

Condición: New.

Taschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held inConcepció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.…

Paperback. Condición: Brand New. 349 pages. 9.25x6.10x1.02 inches. In Stock.

Taschenbuch. Condición: Neu. String Processing and Information Retrieval | 29th International Symposium, SPIRE 2022, Concepción, Chile, November 8-10, 2022, Proceedings | Diego Arroyuelo (u. a.) | Taschenbuch | Lecture Notes in Computer Science | xvii | Englisch | 2022 | Springer | EAN 9783031206429 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.…

Condición: Hervorragend. Zustand: Hervorragend | Seiten: 352 | Sprache: Englisch | Produktart: Bücher | 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.…

Condición: new. Questo è un articolo print on demand.

Taschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book constitutes the refereed proceedings of the 29th International Symposium on String Processing and Information Retrieval, SPIRE 2022, held inConcepció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. 352 pp. Englisch.…

Condición: New. Print on Demand.

Condición: New. PRINT ON DEMAND.

Taschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer-Verlag KG, Sachsenplatz 4-6, 1201 Wien 352 pp. Englisch.…