String Processing and Information Retrieval: Lecture Notes in Computer Science
Editat de Diego Arroyuelo, Barbara Pobleteen Limba Engleză Paperback – noi 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.
Din seria Lecture Notes in Computer Science
- 15%
Preț: 558.12 lei - 20%
Preț: 573.45 lei - 20%
Preț: 330.54 lei - 20%
Preț: 620.33 lei - 20%
Preț: 400.77 lei - 20%
Preț: 1033.45 lei - 20%
Preț: 629.71 lei - 20%
Preț: 328.94 lei - 20%
Preț: 375.72 lei - 20%
Preț: 568.70 lei - 20%
Preț: 1359.66 lei - 20%
Preț: 489.11 lei - 20%
Preț: 560.93 lei - 20%
Preț: 731.97 lei - 20%
Preț: 563.29 lei - 20%
Preț: 403.00 lei - 20%
Preț: 782.57 lei - 20%
Preț: 336.86 lei - 20%
Preț: 560.93 lei - 20%
Preț: 850.42 lei - 20%
Preț: 432.78 lei - 20%
Preț: 342.61 lei - 20%
Preț: 631.96 lei - 20%
Preț: 904.16 lei - 20%
Preț: 1391.87 lei - 20%
Preț: 487.46 lei - 20%
Preț: 400.17 lei - 20%
Preț: 984.64 lei - 20%
Preț: 556.96 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1020.28 lei - 20%
Preț: 793.92 lei - 20%
Preț: 733.68 lei - 20%
Preț: 1137.10 lei - 20%
Preț: 679.09 lei - 20%
Preț: 558.53 lei - 20%
Preț: 327.36 lei - 20%
Preț: 340.04 lei - 20%
Preț: 327.36 lei - 20%
Preț: 560.93 lei - 20%
Preț: 324.19 lei - 20%
Preț: 1079.23 lei - 20%
Preț: 735.28 lei - 20%
Preț: 373.80 lei -
Preț: 395.25 lei - 20%
Preț: 488.90 lei - 20%
Preț: 293.24 lei
Preț: 460.63 lei
Preț vechi: 575.79 lei
-20%
Puncte Express: 691
Preț estimativ în valută:
81.43€ • 96.80$ • 70.66£
81.43€ • 96.80$ • 70.66£
Carte disponibilă
Livrare economică 19 februarie-05 martie
Livrare express 04-10 februarie pentru 36.01 lei
Specificații
ISBN-13: 9783031206429
ISBN-10: 3031206428
Pagini: 352
Ilustrații: XVII, 332 p. 66 illus., 41 illus. in color.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
ISBN-10: 3031206428
Pagini: 352
Ilustrații: XVII, 332 p. 66 illus., 41 illus. in color.
Dimensiuni: 155 x 235 x 20 mm
Greutate: 0.53 kg
Ediția:1st edition 2022
Editura: Springer
Seria Lecture Notes in Computer Science
Locul publicării:Cham, Switzerland
Cuprins
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.