↓ 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 Greedy Shortest Common Superstring Approximation in Compact Space
  3. Altmetric Badge
    Chapter 2 Longest Common Factor After One Edit Operation
  4. Altmetric Badge
    Chapter 3 Distinct Squares in Circular Words
  5. Altmetric Badge
    Chapter 4 LZ78 Compression in Low Main Memory Space
  6. Altmetric Badge
    Chapter 5 On Two LZ78-style Grammars: Compression Bounds and Compressed-Space Computation
  7. Altmetric Badge
    Chapter 6 On Suffix Tree Breadth
  8. Altmetric Badge
    Chapter 7 Pattern Matching on Elastic-Degenerate Text with Errors
  9. Altmetric Badge
    Chapter 8 Succinct Partial Sums and Fenwick Trees
  10. Altmetric Badge
    Chapter 9 Tight Bounds for Top Tree Compression
  11. Altmetric Badge
    Chapter 10 Efficient Compression and Indexing of Trajectories
  12. Altmetric Badge
    Chapter 11 Fast Construction of Compressed Web Graphs
  13. Altmetric Badge
    Chapter 12 Constructing a Consensus Phylogeny from a Leaf-Removal Distance (Extended Abstract)
  14. Altmetric Badge
    Chapter 13 Listing Maximal Independent Sets with Minimal Space and Bounded Delay
  15. Altmetric Badge
    Chapter 14 Fast Label Extraction in the CDAWG
  16. Altmetric Badge
    Chapter 15 Lightweight BWT and LCP Merging via the Gap Algorithm
  17. Altmetric Badge
    Chapter 16 Practical Evaluation of Lempel-Ziv-78 and Lempel-Ziv-Welch Tries
  18. Altmetric Badge
    Chapter 17 Regular Abelian Periods and Longest Common Abelian Factors on Run-Length Encoded Strings
  19. Altmetric Badge
    Chapter 18 Mining Bit-Parallel LCS-length Algorithms
  20. Altmetric Badge
    Chapter 19 Practical Implementation of Space-Efficient Dynamic Keyword Dictionaries
  21. Altmetric Badge
    Chapter 20 Faster Practical Block Compression for Rank/Select Dictionaries
  22. Altmetric Badge
    Chapter 21 Optimal Skeleton Huffman Trees
  23. Altmetric Badge
    Chapter 22 Detecting One-Variable Patterns
  24. Altmetric Badge
    Chapter 23 Order Preserving Pattern Matching on Trees and DAGs
  25. Altmetric Badge
    Chapter 24 A Self-index on Block Trees
  26. Altmetric Badge
    Chapter 25 Counting Palindromes in Substrings
  27. Altmetric Badge
    Chapter 26 Linear-Size CDAWG: New Repetition-Aware Indexing and Grammar Compression
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

news
1 news outlet
twitter
7 X users

Readers on

mendeley
9 Mendeley
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, Cham, January 2017
DOI 10.1007/978-3-319-67428-5
ISBNs
978-3-31-967427-8, 978-3-31-967428-5
Editors

Gabriele Fici, Marinella Sciortino, Rossano Venturini

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.
Mendeley readers

Mendeley readers

The data shown below were compiled from readership statistics for 9 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 9 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 11%
Unknown 8 89%
Readers by discipline Count As %
Computer Science 1 11%
Unknown 8 89%