Cantitate/Preț
Produs
Total produse
Vezi coșul
String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings de Gabriele Fici

String Processing and Information Retrieval: 24th International Symposium, SPIRE 2017, Palermo, Italy, September 26–29, 2017, Proceedings: Lecture Notes in Computer Science, cartea 10508

Editat de Gabriele Fici, Marinella Sciortino, Rossano Venturini
en Limba Engleză Paperback – 6 sep 2017
This book constitutes the proceedings of the 24th International Symposium on String Processing and Information Retrieval, SPIRE 2017, held in Palermo, Italy, in September 2017.
The 26 papers presented in this volume were carefully reviewed and selected from 71 submissions. They focus on fundamental studies on string processing and information retrieval, as well as on computational biology. 
Citește tot Restrânge

Din seria Lecture Notes in Computer Science

Preț: 32780 lei

Preț vechi: 40975 lei
-20% Nou

Puncte Express: 492
Preț estimativ în valută:
6273€ • 6516$ • 5211£

Carte tipărită la comandă

Livrare economică 01-15 februarie 25

 Adaugă în coș

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

Specificații

ISBN-13: 9783319674278
ISBN-10: 3319674277
Pagini: 318
Ilustrații: XIX, 318 p. 65 illus.
Dimensiuni: 155 x 235 mm
Greutate: 0.48 kg
Ediția:1st ed. 2017
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

Greedy shortest common superstring approximation in compact space.- Longest common factor after one edit operation.- Distinct squares in circular words.- LZ78 Compression in Low Main Memory Space.- On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation.-On suffix tree breadth.- Pattern Matching on Elastic-Degenerate Text with Errors.- Succint Partial Sums and Fenwick Trees.- Tight Bounds for Top Tree Compression.- Efficient Compression and Indexing of Trajectories.- Fast Construction of Compressed Web Graphs.- Constructing a Consensus Phylogeny from a Leaf-Removal Distance.- Listing Maximal Independent Sets with Minimal Space and Bounded Delay.- Fast label extraction in the CDAWG.- Lightweight BWT and LCP Merging via the Gap algorithm.- Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries.- Regular Abelian periods and longest common Abelian factors on run-length encoded strings.-Mining bit-parallel LCS-length algorithms.- Practical Implementationof Space-Efficient Dynamic Keyword Dictionaries.- Faster Practical Block Compression for Rank/Select Dictionaries.- Optimal Skeleton Huffman Trees.- Detecting Unary Patterns.- Order preserving pattern matching on trees and DAGs.- A Self-Index on Block Trees.- Counting Palindromes in Substrings.- linear-size CDAWG: new repetition-aware indexing and grammar compression. 

Caracteristici

Includes supplementary material: sn.pub/extras