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.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : Brook Bookstore On Demand, Napoli, NA, Italie
Etat : new. Questo è un articolo print on demand. N° de réf. du vendeur IDILBMCYBI
Quantité disponible : Plus de 20 disponibles
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783031206429_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. N° de réf. du vendeur 6666-IUK-9783031206429
Quantité disponible : 10 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783031206429
Quantité disponible : 2 disponible(s)
Vendeur : Books Puddle, New York, NY, Etats-Unis
Etat : New. 1st ed. 2022 edition NO-PA16APR2015-KAP. N° de réf. du vendeur 26396295369
Quantité disponible : 4 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : New. N° de réf. du vendeur 723466409
Quantité disponible : Plus de 20 disponibles
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand. N° de réf. du vendeur 401163030
Quantité disponible : 4 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND. N° de réf. du vendeur 18396295363
Quantité disponible : 4 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 349 pages. 9.25x6.10x1.02 inches. In Stock. N° de réf. du vendeur x-3031206428
Quantité disponible : 2 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : 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. N° de réf. du vendeur 9783031206429
Quantité disponible : 1 disponible(s)