↓ 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 Constructing Strings at the Nano Scale via Staged Self-assembly
  3. Altmetric Badge
    Chapter 2 Discounted Cumulative Gain and User Decision Models
  4. Altmetric Badge
    Chapter 3 Cross-Lingual Text Fragment Alignment Using Divergence from Randomness
  5. Altmetric Badge
    Chapter 4 Enhancing Document Snippets Using Temporal Information
  6. Altmetric Badge
    Chapter 5 Spaced Seeds Design Using Perfect Rulers
  7. Altmetric Badge
    Chapter 6 Weighted Shortest Common Supersequence
  8. Altmetric Badge
    Chapter 7 Approximate Regular Expression Matching with Multi-strings
  9. Altmetric Badge
    Chapter 8 Persistency in Suffix Trees with Applications to String Interval Problems
  10. Altmetric Badge
    Chapter 9 Approximate Point Set Pattern Matching with L p -Norm
  11. Altmetric Badge
    Chapter 10 Detecting Health Events on the Social Web to Enable Epidemic Intelligence
  12. Altmetric Badge
    Chapter 11 A Learned Approach for Ranking News in Real-Time Using the Blogosphere
  13. Altmetric Badge
    Chapter 12 Attribute Retrieval from Relational Web Tables
  14. Altmetric Badge
    Chapter 13 Query-Sets + + : A Scalable Approach for Modeling Web Sites
  15. Altmetric Badge
    Chapter 14 Indexing with Gaps
  16. Altmetric Badge
    Chapter 15 Fast Computation of a String Duplication History under No-Breakpoint-Reuse
  17. Altmetric Badge
    Chapter 16 Near Real-Time Suffix Tree Construction via the Fringe Marked Ancestor Problem
  18. Altmetric Badge
    Chapter 17 Approximations and Partial Solutions for the Consensus Sequence Problem
  19. Altmetric Badge
    Chapter 18 Fixed Block Compression Boosting in FM-Indexes
  20. Altmetric Badge
    Chapter 19 Space Efficient Wavelet Tree Construction
  21. Altmetric Badge
    Chapter 20 Computing the Longest Common Prefix Array Based on the Burrows-Wheeler Transform
  22. Altmetric Badge
    Chapter 21 A Succinct Index for Hypertext
  23. Altmetric Badge
    Chapter 22 When Was It Written? Automatically Determining Publication Dates
  24. Altmetric Badge
    Chapter 23 A New Approach for Verifying URL Uniqueness in Web Crawlers
  25. Altmetric Badge
    Chapter 24 External Query Reformulation for Text-Based Image Retrieval
  26. Altmetric Badge
    Chapter 25 A Knowledge-Based Semantic Kernel for Text Classification
  27. Altmetric Badge
    Chapter 26 Compressed Text Indexing with Wildcards
  28. Altmetric Badge
    Chapter 27 Fast q-gram Mining on SLP Compressed Strings
  29. Altmetric Badge
    Chapter 28 Succinct Gapped Suffix Arrays
  30. Altmetric Badge
    Chapter 29 Finding Frequent Elements in Compressed 2D Arrays and Strings
  31. Altmetric Badge
    Chapter 30 On Suffix Extensions in Suffix Trees
  32. Altmetric Badge
    Chapter 31 COCA Filters: Co-occurrence Aware Bloom Filters
  33. Altmetric Badge
    Chapter 32 On-Line Construction of Position Heaps
  34. Altmetric Badge
    Chapter 33 Computing All Subtree Repeats in Ordered Ranked Trees
  35. Altmetric Badge
    Chapter 34 Sparse Spatial Selection for Novelty-Based Search Result Diversification
  36. Altmetric Badge
    Chapter 35 Candidate Document Retrieval for Web-Scale Text Reuse Detection
  37. Altmetric Badge
    Chapter 36 A Multi-faceted Approach to Query Intent Classification
  38. Altmetric Badge
    Chapter 37 Navigating the User Query Space
  39. Altmetric Badge
    Chapter 38 Improved Compressed Indexes for Full-Text Document Retrieval
  40. Altmetric Badge
    Chapter 39 ESP-Index: A Compressed Index Based on Edit-Sensitive Parsing
  41. Altmetric Badge
    Chapter 40 Compressed Indexes for Aligned Pattern Matching
  42. Altmetric Badge
    Chapter 41 String Processing and Information Retrieval
Attention for Chapter 29: Finding Frequent Elements in Compressed 2D Arrays and Strings
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age and source (65th percentile)

Mentioned by

wikipedia
1 Wikipedia page

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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
Finding Frequent Elements in Compressed 2D Arrays and Strings
Chapter number 29
Book title
String Processing and Information Retrieval
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-24583-1_29
Book ISBNs
978-3-64-224582-4, 978-3-64-224583-1
Authors

Travis Gagie, Meng He, J. Ian Munro, Patrick K. Nicholson, Gagie, Travis, He, Meng, Munro, J. Ian, Nicholson, Patrick K.

Editors

Roberto Grossi, Fabrizio Sebastiani, Fabrizio Silvestri

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Student > Bachelor 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 2 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 3. 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 20 December 2021.
All research outputs
#7,435,148
of 22,729,647 outputs
Outputs from Lecture notes in computer science
#2,490
of 8,126 outputs
Outputs of similar age
#54,296
of 180,470 outputs
Outputs of similar age from Lecture notes in computer science
#75
of 317 outputs
Altmetric has tracked 22,729,647 research outputs across all sources so far. This one is in the 44th percentile – i.e., 44% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,126 research outputs from this source. They receive a mean Attention Score of 5.0. This one has gotten more attention than average, scoring higher than 54% 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 180,470 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 27th percentile – i.e., 27% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 317 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 65% of its contemporaries.