↓ Skip to main content

Combinatorial Pattern Matching

Overview of attention for book
Cover of 'Combinatorial Pattern Matching'

Table of Contents

  1. Altmetric Badge
    Book Overview
  2. Altmetric Badge
    Chapter 1 Forty Years of Text Indexing
  3. Altmetric Badge
    Chapter 2 LCP Magic
  4. Altmetric Badge
    Chapter 3 Discrete Methods for Image Analysis Applied to Molecular Biology
  5. Altmetric Badge
    Chapter 4 Locating All Maximal Approximate Runs in a String
  6. Altmetric Badge
    Chapter 5 On Minimal and Maximal Suffixes of a Substring
  7. Altmetric Badge
    Chapter 6 Converting SLP to LZ78 in almost Linear Time
  8. Altmetric Badge
    Chapter 7 A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
  9. Altmetric Badge
    Chapter 8 Compact q-Gram Profiling of Compressed Strings
  10. Altmetric Badge
    Chapter 9 A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
  11. Altmetric Badge
    Chapter 10 Pattern Matching with Variables: A Multivariate Complexity Analysis
  12. Altmetric Badge
    Chapter 11 New Algorithms for Position Heaps
  13. Altmetric Badge
    Chapter 12 Document Listing on Repetitive Collections
  14. Altmetric Badge
    Chapter 13 Approximating Shortest Superstring Problem Using de Bruijn Graphs
  15. Altmetric Badge
    Chapter 14 Local Search for String Problems: Brute Force Is Essentially Optimal
  16. Altmetric Badge
    Chapter 15 Space-Efficient Construction Algorithm for the Circular Suffix Tree
  17. Altmetric Badge
    Chapter 16 Efficient Lyndon Factorization of Grammar Compressed Text
  18. Altmetric Badge
    Chapter 17 Approximation of Grammar-Based Compression via Recompression
  19. Altmetric Badge
    Chapter 18 Fast Algorithm for Partial Covers in Words
  20. Altmetric Badge
    Chapter 19 Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
  21. Altmetric Badge
    Chapter 20 External Memory Generalized Suffix and LCP Arrays Construction
  22. Altmetric Badge
    Chapter 21 Efficient All Path Score Computations on Grid Graphs
  23. Altmetric Badge
    Chapter 22 Time-Space Trade-Offs for the Longest Common Substring Problem
  24. Altmetric Badge
    Chapter 23 A Succinct Grammar Compression
  25. Altmetric Badge
    Chapter 24 Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Attention for Chapter 9: A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
Altmetric Badge

Mentioned by

twitter
1 X user

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
8 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
A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
Chapter number 9
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, June 2013
DOI 10.1007/978-3-642-38905-4_9
Book ISBNs
978-3-64-238904-7, 978-3-64-238905-4
Authors

Maxime Crochemore, Roberto Grossi, Juha Kärkkäinen, Gad M. Landau, Juha Kärkkäinen, Crochemore, Maxime, Grossi, Roberto, Kärkkäinen, Juha, Landau, Gad M.

X Demographics

X Demographics

The data shown below were collected from the profile of 1 X user 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 8 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
United States 1 13%
Unknown 7 88%

Demographic breakdown

Readers by professional status Count As %
Researcher 4 50%
Professor 2 25%
Student > Ph. D. Student 1 13%
Student > Doctoral Student 1 13%
Readers by discipline Count As %
Computer Science 6 75%
Physics and Astronomy 1 13%
Unknown 1 13%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 1. 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 14 August 2013.
All research outputs
#18,343,746
of 22,716,996 outputs
Outputs from Lecture notes in computer science
#6,005
of 8,124 outputs
Outputs of similar age
#147,827
of 196,787 outputs
Outputs of similar age from Lecture notes in computer science
#100
of 130 outputs
Altmetric has tracked 22,716,996 research outputs across all sources so far. This one is in the 11th percentile – i.e., 11% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,124 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 14th percentile – i.e., 14% of its peers scored the same or lower than it.
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 196,787 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 130 others from the same source and published within six weeks on either side of this one. This one is in the 12th percentile – i.e., 12% of its contemporaries scored the same or lower than it.