Cantitate/Preț
Produs
Total produse
Vezi coșul
String Processing and Information Retrieval: 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings de Thierry Lecroq

String Processing and Information Retrieval: 28th International Symposium, SPIRE 2021, Lille, France, October 4–6, 2021, Proceedings: Lecture Notes in Computer Science, cartea 12944

Editat de Thierry Lecroq, Hélène Touzet
en Limba Engleză Paperback – 28 sep 2021
This book constitutes the refereed proceedings of the 27th International Symposium on String Processing and Information Retrieval, SPIRE 2021, held in Lille, France, in October 2021.* The 14 full papers and 4 short papers presented together with 2 invited papers in this volume were carefully reviewed and selected from 30 submissions. They cover topics such as: data structures; algorithms; information retrieval; compression; combinatorics on words; and computational biology.
*The symposium was held virtually.
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 40051 lei

Preț vechi: 50064 lei
-20% Nou

Puncte Express: 601
Preț estimativ în valută:
7087€ • 8322$ • 6220£

Carte tipărită la comandă

Livrare economică 27 ianuarie-10 februarie 26

 Adaugă în coș

Wish list
Gift list
Am citit!
Adaugă în listă
Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9783030866914
ISBN-10: 3030866912
Pagini: 255
Ilustrații: X, 255 p. 47 illus., 29 illus. in color.
Dimensiuni: 155 x 235 mm
Greutate: 0.38 kg
Ediția:1st ed. 2021
Editura: Springer International Publishing
Colecția Springer
Seriile Lecture Notes in Computer Science, Theoretical Computer Science and General Issues

Locul publicării:Cham, Switzerland

Cuprins

Invited papers.- r-indexing the eBWT.- Unicode at Gigabytes per Second.- Combinatorics.- Longest Common Rollercoasters.- Minimal unique palindromic substrings after single-character substitution.- Permutation-constrained Common String Partitions with Applications.- All instantiations of the greedy algorithm for the shortest superstring problem are equivalent.- String Covers of a Tree.- Compression.- Grammar Index By Induced Suffix Sorting.- An LMS-based Grammar Self-index with Local Consistency Properties.- On the approximation ratio of LZ-End to LZ77.- Data Structures.- Computing the original eBWT faster, simpler, and with less memory.- Extracting the Sparse Longest Common Pre x Array from the Suffix Binary Search Tree.- findere: fast and precise approximate membership query.- Repeats.- Improved Topic Modeling in Twitter through Community Pooling.- Lower Bounds for the Number of Repetitions in 2D Strings.- On Stricter Reachable Repetitiveness Measures.- Information Retrieval.- Improved Topic modeling in Twitter through Community Pooling.- TSXor: A Simple Time Series Compression Algorithm.- Pattern Matching.- Exploiting Pseudo-Locality of Interchange Distance.- Position Heaps for Cartesian-tree Matching on Strings and Tries.