↓ 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 Range Quantile Queries: Another Virtue of Wavelet Trees
  3. Altmetric Badge
    Chapter 2 Constant Factor Approximation of Edit Distance of Bounded Height Unordered Trees
  4. Altmetric Badge
    Chapter 3 k 2 -Trees for Compact Web Graph Representation
  5. Altmetric Badge
    Chapter 4 On-Line Construction of Parameterized Suffix Trees
  6. Altmetric Badge
    Chapter 5 Succinct Text Indexing with Wildcards
  7. Altmetric Badge
    Chapter 6 A Compressed Enhanced Suffix Array Supporting Fast String Matching
  8. Altmetric Badge
    Chapter 7 Compressed Suffix Arrays for Massive Data
  9. Altmetric Badge
    Chapter 8 On Entropy-Compressed Text Indexing in External Memory
  10. Altmetric Badge
    Chapter 9 A Linear-Time Burrows-Wheeler Transform Using Induced Sorting
  11. Altmetric Badge
    Chapter 10 Novel and Generalized Sort-Based Transform for Lossless Data Compression
  12. Altmetric Badge
    Chapter 11 A Two-Level Structure for Compressing Aligned Bitexts
  13. Altmetric Badge
    Chapter 12 Directly Addressable Variable-Length Codes
  14. Altmetric Badge
    Chapter 13 Identifying the Intent of a User Query Using Support Vector Machines
  15. Altmetric Badge
    Chapter 14 Syntactic Query Models for Restatement Retrieval
  16. Altmetric Badge
    Chapter 15 Use of Co-occurrences for Temporal Expressions Annotation
  17. Altmetric Badge
    Chapter 16 On-Demand Associative Cross-Language Information Retrieval
  18. Altmetric Badge
    Chapter 17 A Comparison of Data-Driven Automatic Syllabification Methods
  19. Altmetric Badge
    Chapter 18 Efficient Index for Retrieving Top- k Most Frequent Documents
  20. Altmetric Badge
    Chapter 19 Fast Single-Pass Construction of a Half-Inverted Index
  21. Altmetric Badge
    Chapter 20 Two-Dimensional Distributed Inverted Files
  22. Altmetric Badge
    Chapter 21 Indexing Variable Length Substrings for Exact and Approximate Matching
  23. Altmetric Badge
    Chapter 22 Expectation of Strings with Mismatches under Markov Chain Distribution
  24. Altmetric Badge
    Chapter 23 Consensus Optimizing Both Distance Sum and Radius
  25. Altmetric Badge
    Chapter 24 Faster Algorithms for Sampling and Counting Biological Sequences
  26. Altmetric Badge
    Chapter 25 Towards a Theory of Patches
  27. Altmetric Badge
    Chapter 26 The Frequent Items Problem, under Polynomial Decay, in the Streaming Model
  28. Altmetric Badge
    Chapter 27 Improved Approximation Results on the Shortest Common Supersequence Problem
  29. Altmetric Badge
    Chapter 28 Set Intersection and Sequence Matching
  30. Altmetric Badge
    Chapter 29 Generalised Matching
  31. Altmetric Badge
    Chapter 30 Practical Algorithms for the Longest Common Extension Problem
  32. Altmetric Badge
    Chapter 31 A Last-Resort Semantic Cache for Web Queries
  33. Altmetric Badge
    Chapter 32 A Task-Based Evaluation of an Aggregated Search Interface
  34. Altmetric Badge
    Chapter 33 Efficient Language-Independent Retrieval of Printed Documents without OCR
  35. Altmetric Badge
    Chapter 34 Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
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 (82nd percentile)
  • High Attention Score compared to outputs of the same age and source (89th percentile)

Mentioned by

twitter
3 X users
patent
3 patents
wikipedia
1 Wikipedia page

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
1 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
ADS, August 2009
DOI 10.1007/978-3-642-03784-9
ISBNs
978-3-64-203783-2, 978-3-64-203784-9
Editors

Karlgren, Jussi, Tarhio, Jorma, Hyyrö, Heikki

X Demographics

X Demographics

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

Geographical breakdown

Country Count As %
United States 1 100%

Demographic breakdown

Readers by professional status Count As %
Student > Master 1 100%
Readers by discipline Count As %
Computer Science 1 100%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 8. 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 07 March 2023.
All research outputs
#4,792,785
of 26,017,215 outputs
Outputs from ADS
#2,964
of 27,022 outputs
Outputs of similar age
#19,882
of 122,749 outputs
Outputs of similar age from ADS
#36
of 335 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 81st percentile: it's in the top 25% of all research outputs ever tracked by Altmetric.
So far Altmetric has tracked 27,022 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.1. This one has done well, scoring higher than 88% 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 122,749 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 82% of its contemporaries.
We're also able to compare this research output to 335 others from the same source and published within six weeks on either side of this one. This one has done well, scoring higher than 89% of its contemporaries.