↓ 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 Regular Expression Searching over Ziv-Lempel Compressed Text
  3. Altmetric Badge
    Chapter 2 Parallel Lempel Ziv Coding (Extended Abstract)
  4. Altmetric Badge
    Chapter 3 Approximate Matching of Run-Length Compressed Strings
  5. Altmetric Badge
    Chapter 4 What to Do with All this Hardware? (Invited Lecture)
  6. Altmetric Badge
    Chapter 5 Efficient Experimental String Matching by Weak Factor Recognition *
  7. Altmetric Badge
    Chapter 6 Better Filtering with Gapped q-Grams
  8. Altmetric Badge
    Chapter 7 Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract)
  9. Altmetric Badge
    Chapter 8 An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture)
  10. Altmetric Badge
    Chapter 9 A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
  11. Altmetric Badge
    Chapter 10 Tandem Cyclic Alignment
  12. Altmetric Badge
    Chapter 11 An Output-Sensitive Flexible Pattern Discovery Algorithm
  13. Altmetric Badge
    Chapter 12 Episode Matching *
  14. Altmetric Badge
    Chapter 13 String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music
  15. Altmetric Badge
    Chapter 14 Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract)
  16. Altmetric Badge
    Chapter 15 Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time
  17. Altmetric Badge
    Chapter 16 On-Line Construction of Compact Directed Acyclic Word Graphs *
  18. Altmetric Badge
    Chapter 17 Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
  19. Altmetric Badge
    Chapter 18 Multiple Pattern Matching Algorithms on Collage System
  20. Altmetric Badge
    Chapter 19 Finding All Common Intervals of k Permutations
  21. Altmetric Badge
    Chapter 20 Generalized Pattern Matching and the Complexity of Unavoidability Testing
  22. Altmetric Badge
    Chapter 21 Balanced Suffix Trees (Invited Lecture)
  23. Altmetric Badge
    Chapter 22 A Fast Algorithm for Optimal Alignment between Similar Ordered Trees
  24. Altmetric Badge
    Chapter 23 Minimum Quartet Inconsistency Is Fixed Parameter Tractable
  25. Altmetric Badge
    Chapter 24 Optimally Compact Finite Sphere Packings — Hydrophobic Cores in the FCC
Attention for Chapter 17: Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
Altmetric Badge

About this Attention Score

  • Good Attention Score compared to outputs of the same age (68th percentile)
  • Above-average Attention Score compared to outputs of the same age and source (55th percentile)

Mentioned by

twitter
2 X users
wikipedia
2 Wikipedia pages

Readers on

mendeley
84 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
Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications
Chapter number 17
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, July 2001
DOI 10.1007/3-540-48194-x_17
Book ISBNs
978-3-54-042271-6, 978-3-54-048194-2
Authors

Toru Kasai, Gunho Lee, Hiroki Arimura, Setsuo Arikawa, Kunsoo Park, Kasai, Toru, Lee, Gunho, Arimura, Hiroki, Arikawa, Setsuo, Park, Kunsoo

X Demographics

X Demographics

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

Geographical breakdown

Country Count As %
France 5 6%
Germany 1 1%
Spain 1 1%
United States 1 1%
Poland 1 1%
Unknown 75 89%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 21 25%
Researcher 15 18%
Student > Master 12 14%
Student > Bachelor 8 10%
Professor > Associate Professor 7 8%
Other 14 17%
Unknown 7 8%
Readers by discipline Count As %
Computer Science 56 67%
Engineering 6 7%
Agricultural and Biological Sciences 6 7%
Physics and Astronomy 2 2%
Biochemistry, Genetics and Molecular Biology 2 2%
Other 3 4%
Unknown 9 11%
Attention Score in Context

Attention Score in Context

This research output has an Altmetric Attention Score of 5. 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 18 June 2021.
All research outputs
#7,304,457
of 26,017,215 outputs
Outputs from Lecture notes in computer science
#2,100
of 8,229 outputs
Outputs of similar age
#13,074
of 42,046 outputs
Outputs of similar age from Lecture notes in computer science
#9
of 20 outputs
Altmetric has tracked 26,017,215 research outputs across all sources so far. This one has received more attention than most of these and is in the 71st percentile.
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 gotten more attention than average, scoring higher than 74% 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 42,046 tracked outputs that were published within six weeks on either side of this one in any source. This one has gotten more attention than average, scoring higher than 68% of its contemporaries.
We're also able to compare this research output to 20 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 55% of its contemporaries.