↓ 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 RLZAP: Relative Lempel-Ziv with Adaptive Pointers
  3. Altmetric Badge
    Chapter 2 A Linear-Space Algorithm for the Substring Constrained Alignment Problem
  4. Altmetric Badge
    Chapter 3 Near-Optimal Computation of Runs over General Alphabet via Non-Crossing LCE Queries
  5. Altmetric Badge
    Chapter 4 The Smallest Grammar Problem Revisited
  6. Altmetric Badge
    Chapter 5 Efficient and Compact Representations of Some Non-canonical Prefix-Free Codes
  7. Altmetric Badge
    Chapter 6 Parallel Lookups in String Indexes
  8. Altmetric Badge
    Chapter 7 Fast Classification of Protein Structures by an Alignment-Free Kernel
  9. Altmetric Badge
    Chapter 8 XBWT Tricks
  10. Altmetric Badge
    Chapter 9 Maximal Unbordered Factors of Random Strings
  11. Altmetric Badge
    Chapter 10 Fragmented BWT: An Extended BWT for Full-Text Indexing
  12. Altmetric Badge
    Chapter 11 AC-Automaton Update Algorithm for Semi-dynamic Dictionary Matching
  13. Altmetric Badge
    Chapter 12 Parallel Computation for the All-Pairs Suffix-Prefix Problem
  14. Altmetric Badge
    Chapter 13 Dynamic and Approximate Pattern Matching in 2D
  15. Altmetric Badge
    Chapter 14 Fully Dynamic de Bruijn Graphs
  16. Altmetric Badge
    Chapter 15 Bookmarks in Grammar-Compressed Strings
  17. Altmetric Badge
    Chapter 16 Analyzing Relative Lempel-Ziv Reference Construction
  18. Altmetric Badge
    Chapter 17 Inverse Range Selection Queries
  19. Altmetric Badge
    Chapter 18 Low Space External Memory Construction of the Succinct Permuted Longest Common Prefix Array
  20. Altmetric Badge
    Chapter 19 Efficient Representation of Multidimensional Data over Hierarchical Domains
  21. Altmetric Badge
    Chapter 20 LCP Array Construction Using O(sort(n)) (or Less) I/Os
  22. Altmetric Badge
    Chapter 21 GraCT: A Grammar Based Compressed Representation of Trajectories
  23. Altmetric Badge
    Chapter 22 Lexical Matching of Queries and Ads Bid Terms in Sponsored Search
  24. Altmetric Badge
    Chapter 23 Compact Trip Representation over Networks
  25. Altmetric Badge
    Chapter 24 Longest Common Abelian Factors and Large Alphabets
  26. Altmetric Badge
    Chapter 25 Pattern Matching for Separable Permutations
Overall attention for this book and its chapters
Altmetric Badge

About this Attention Score

  • In the top 25% of all research outputs scored by Altmetric
  • High Attention Score compared to outputs of the same age (86th percentile)
  • Good Attention Score compared to outputs of the same age and source (79th percentile)

Mentioned by

16 X users
2 Wikipedia pages

Readers on

10 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.
String Processing and Information Retrieval
Published by
Lecture notes in computer science, January 2016
DOI 10.1007/978-3-319-46049-9
978-3-31-946048-2, 978-3-31-946049-9

Shunsuke Inenaga, Kunihiko Sadakane, Tetsuya Sakai

X Demographics

X Demographics

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

Geographical breakdown

Country Count As %
Unknown 10 100%

Demographic breakdown

Readers by professional status Count As %
Student > Postgraduate 1 10%
Unknown 9 90%
Readers by discipline Count As %
Computer Science 1 10%
Unknown 9 90%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 11. 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 30 January 2019.
All research outputs
of 26,017,215 outputs
Outputs from Lecture notes in computer science
of 8,229 outputs
Outputs of similar age
of 405,194 outputs
Outputs of similar age from Lecture notes in computer science
of 585 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. Compared to these this one has done well and is in the 86th percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 8,229 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.3. This one has done particularly well, scoring higher than 91% 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 405,194 tracked outputs that were published within six weeks on either side of this one in any source. This one has done well, scoring higher than 86% of its contemporaries.
We're also able to compare this research output to 585 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 79% of its contemporaries.