↓ Skip to main content

String Processing and Information Retrieval

Overview of attention for book
Cover of 'String Processing and Information Retrieval'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Longest Common Prefix Arrays for Succinct k -Spectra
  3. Altmetric Badge
    Chapter 2 On Suffix Tree Detection
  4. Altmetric Badge
    Chapter 3 Optimally Computing Compressed Indexing Arrays Based on the Compact Directed Acyclic Word Graph
  5. Altmetric Badge
    Chapter 4 Evaluating Regular Path Queries on Compressed Adjacency Matrices
  6. Altmetric Badge
    Chapter 5 Approximate Cartesian Tree Matching: An Approach Using Swaps
  7. Altmetric Badge
    Chapter 6 Optimal Wheeler Language Recognition
  8. Altmetric Badge
    Chapter 7 Approximation and Fixed Parameter Algorithms for the Approximate Cover Problem
  9. Altmetric Badge
    Chapter 8 Data Structures for SMEM-Finding in the PBWT
  10. Altmetric Badge
    Chapter 9 Compressibility Measures for Two-Dimensional Data
  11. Altmetric Badge
    Chapter 10 From de Bruijn Graphs to Variation Graphs – Relationships Between Pangenome Models
  12. Altmetric Badge
    Chapter 11 CAGE: Cache-Aware Graphlet Enumeration
  13. Altmetric Badge
    Chapter 12 Space-Time Trade-Offs for the LCP Array of Wheeler DFAs
  14. Altmetric Badge
    Chapter 13 Computing All-vs-All MEMs in Grammar-Compressed Text
  15. Altmetric Badge
    Chapter 14 Sublinear Time Lempel-Ziv (LZ77) Factorization
  16. Altmetric Badge
    Chapter 15 New Advances in Rightmost Lempel-Ziv
  17. Altmetric Badge
    Chapter 16 Engineering a Textbook Approach to Index Massive String Dictionaries
  18. Altmetric Badge
    Chapter 17 Count-Min Sketch with Variable Number of Hash Functions: An Experimental Study
  19. Altmetric Badge
    Chapter 18 Dynamic Compact Planar Embeddings
  20. Altmetric Badge
    Chapter 19 A Simple Grammar-Based Index for Finding Approximately Longest Common Substrings
  21. Altmetric Badge
    Chapter 20 On the Number of Factors in the LZ-End Factorization
  22. Altmetric Badge
    Chapter 21 Non-overlapping Indexing in BWT-Runs Bounded Space
  23. Altmetric Badge
    Chapter 22 Efficient Parameterized Pattern Matching in Sublinear Space
  24. Altmetric Badge
    Chapter 23 Largest Repetition Factorization of Fibonacci Words
  25. Altmetric Badge
    Chapter 24 String Covers of a Tree Revisited
  26. Altmetric Badge
    Chapter 25 Compacting Massive Public Transport Data
  27. Altmetric Badge
    Chapter 26 Constant Time and Space Updates for the Sigma-Tau Problem
  28. Altmetric Badge
    Chapter 27 Linear-Time Computation of Generalized Minimal Absent Words for Multiple Strings
  29. Altmetric Badge
    Chapter 28 Frequency-Constrained Substring Complexity
  30. Altmetric Badge
    Chapter 29 Chaining of Maximal Exact Matches in Graphs
  31. Altmetric Badge
    Chapter 30 Algorithms and Hardness for the Longest Common Subsequence of Three Strings and Related Problems
  32. Altmetric Badge
    Chapter 31 Binary Mixed-Digit Data Compression Codes
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
7 X users
You are seeing a free-to-access but limited selection of the activity Altmetric has collected about this research output. Click here to find out more.
Title
String Processing and Information Retrieval
Published by
Springer Nature Switzerland, October 2023
DOI 10.1007/978-3-031-43980-3
ISBNs
978-3-03-143979-7, 978-3-03-143980-3
Editors

Nardini, Franco Maria, Pisanti, Nadia, Venturini, Rossano

X Demographics

X Demographics

The data shown below were collected from the profiles of 7 X users who shared this research output. Click here to find out more about how the information was compiled.
As of 1 July 2024, you may notice a temporary increase in the numbers of X profiles with Unknown location. Click here to learn more.