↓ 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
Attention for Chapter 10: Efficient Compression and Indexing of Trajectories
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age
  • Good Attention Score compared to outputs of the same age and source (71st percentile)

Mentioned by

twitter
6 X users

Readers on

mendeley
11 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.
Chapter title
Efficient Compression and Indexing of Trajectories
Chapter number 10
Book title
String Processing and Information Retrieval
Published in
arXiv, September 2017
DOI 10.1007/978-3-319-67428-5_10
Book ISBNs
978-3-31-967427-8, 978-3-31-967428-5
Authors

Nieves R. Brisaboa, Travis Gagie, Adrián Gómez-Brandón, Gonzalo Navarro, José R. Paramá

X Demographics

X Demographics

The data shown below were collected from the profiles of 6 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 11 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 11 100%

Demographic breakdown

Readers by professional status Count As %
Professor 2 18%
Student > Ph. D. Student 2 18%
Other 1 9%
Student > Doctoral Student 1 9%
Lecturer > Senior Lecturer 1 9%
Other 3 27%
Unknown 1 9%
Readers by discipline Count As %
Computer Science 7 64%
Engineering 1 9%
Unknown 3 27%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 2. This is our high-level measure of the quality and quantity of online attention that it has received. This Attention Score, as well as the ranking and number of research outputs shown below, was calculated when the research output was last mentioned on 09 October 2017.
All research outputs
#13,903,378
of 23,577,654 outputs
Outputs from arXiv
#234,672
of 973,463 outputs
Outputs of similar age
#163,409
of 321,532 outputs
Outputs of similar age from arXiv
#5,189
of 20,625 outputs
Altmetric has tracked 23,577,654 research outputs across all sources so far. This one is in the 39th percentile – i.e., 39% of other outputs scored the same or lower than it.
So far Altmetric has tracked 973,463 research outputs from this source. They receive a mean Attention Score of 4.0. This one has gotten more attention than average, scoring higher than 73% of its peers.
Older research outputs will score higher simply because they've had more time to accumulate mentions. To account for age we can compare this Altmetric Attention Score to the 321,532 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 47th percentile – i.e., 47% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 20,625 others from the same source and published within six weeks on either side of this one. This one has gotten more attention than average, scoring higher than 71% of its contemporaries.