↓ 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 Algorithms on Grammar-Compressed Strings
  3. Altmetric Badge
    Chapter 2 Combinatorial Pattern Matching
  4. Altmetric Badge
    Chapter 3 Computational Regulatory Genomics
  5. Altmetric Badge
    Chapter 4 Lempel-Ziv Factorization Revisited
  6. Altmetric Badge
    Chapter 5 Succincter Text Indexing with Wildcards
  7. Altmetric Badge
    Chapter 6 Self-indexing Based on LZ77
  8. Altmetric Badge
    Chapter 7 Filling Scaffolds with Gene Repetitions: Maximizing the Number of Adjacencies
  9. Altmetric Badge
    Chapter 8 String Comparison and Lyndon-Like Factorization Using V-Order in Linear Time
  10. Altmetric Badge
    Chapter 9 A d -Step Approach for Distinct Squares in Strings
  11. Altmetric Badge
    Chapter 10 Tractability Results for the Consecutive-Ones Property with Multiplicity
  12. Altmetric Badge
    Chapter 11 Forest Alignment with Affine Gaps and Anchors
  13. Altmetric Badge
    Chapter 12 Phylogenetic Footprinting and Consistent Sets of Local Aligments
  14. Altmetric Badge
    Chapter 13 Unique Perfect Phylogeny Is NP -Hard
  15. Altmetric Badge
    Chapter 14 Fast Error-Tolerant Quartet Phylogeny Algorithms
  16. Altmetric Badge
    Chapter 15 Real-Time Streaming String-Matching
  17. Altmetric Badge
    Chapter 16 Simple Real-Time Constant-Space String Matching
  18. Altmetric Badge
    Chapter 17 Space Lower Bounds for Online Pattern Matching
  19. Altmetric Badge
    Chapter 18 Counting Colours in Compressed Strings
  20. Altmetric Badge
    Chapter 19 On Wavelet Tree Construction
  21. Altmetric Badge
    Chapter 20 Lightweight BWT Construction for Very Large String Collections
  22. Altmetric Badge
    Chapter 21 Palindrome Pattern Matching
  23. Altmetric Badge
    Chapter 22 Sparse and Truncated Suffix Trees on Variable-Length Codes
  24. Altmetric Badge
    Chapter 23 On the Weak Prefix-Search Problem
  25. Altmetric Badge
    Chapter 24 Quick Greedy Computation for Minimum Common String Partitions
  26. Altmetric Badge
    Chapter 25 LRM-Trees: Compressed Indices, Adaptive Sorting, and Compressed Permutations
  27. Altmetric Badge
    Chapter 26 Substring Range Reporting
  28. Altmetric Badge
    Chapter 27 Faster Subsequence and Don’t-Care Pattern Matching on Compressed Texts
  29. Altmetric Badge
    Chapter 28 A Combinatorial Model of Phyllotaxis Perturbations in Arabidopsis thaliana
  30. Altmetric Badge
    Chapter 29 Tractability and Approximability of Maximal Strip Recovery
  31. Altmetric Badge
    Chapter 30 Efficient Seeds Computation Revisited
  32. Altmetric Badge
    Chapter 31 Efficient Matching of Biological Sequences Allowing for Non-overlapping Inversions
  33. Altmetric Badge
    Chapter 32 A Coarse-to-Fine Approach to Computing the k -Best Viterbi Paths
  34. Altmetric Badge
    Chapter 33 Finding Approximate and Constrained Motifs in Graphs
  35. Altmetric Badge
    Chapter 34 Improved MAX SNP-Hard Results for Finding an Edit Distance between Unordered Trees
  36. Altmetric Badge
    Chapter 35 Approximation Algorithms for Orienting Mixed Graphs
  37. Altmetric Badge
    Chapter 36 Frequent Submap Discovery
  38. Altmetric Badge
    Chapter 37 Edit Distance with Duplications and Contractions Revisited
  39. Altmetric Badge
    Chapter 38 Polynomial-Time Approximation Algorithms for Weighted LCS Problem
  40. Altmetric Badge
    Chapter 39 Restricted Common Superstring and Restricted Common Supersequence
Attention for Chapter 20: Lightweight BWT Construction for Very Large String Collections
Altmetric Badge

About this Attention Score

  • Average Attention Score compared to outputs of the same age and source

Mentioned by

twitter
2 X users

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
30 Mendeley
citeulike
2 CiteULike
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
Lightweight BWT Construction for Very Large String Collections
Chapter number 20
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, January 2011
DOI 10.1007/978-3-642-21458-5_20
Book ISBNs
978-3-64-221457-8, 978-3-64-221458-5
Authors

Markus J. Bauer, Anthony J. Cox, Giovanna Rosone, Bauer, Markus J., Cox, Anthony J., Rosone, Giovanna

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 30 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
France 2 7%
United States 1 3%
Brazil 1 3%
Unknown 26 87%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 11 37%
Researcher 6 20%
Student > Master 4 13%
Other 2 7%
Professor 2 7%
Other 4 13%
Unknown 1 3%
Readers by discipline Count As %
Computer Science 18 60%
Agricultural and Biological Sciences 8 27%
Biochemistry, Genetics and Molecular Biology 2 7%
Unknown 2 7%
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 28 October 2022.
All research outputs
#15,473,755
of 22,994,508 outputs
Outputs from Lecture notes in computer science
#4,662
of 8,146 outputs
Outputs of similar age
#141,486
of 181,640 outputs
Outputs of similar age from Lecture notes in computer science
#150
of 318 outputs
Altmetric has tracked 22,994,508 research outputs across all sources so far. This one is in the 22nd percentile – i.e., 22% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,146 research outputs from this source. They receive a mean Attention Score of 5.0. This one is in the 27th percentile – i.e., 27% 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 181,640 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 318 others from the same source and published within six weeks on either side of this one. This one is in the 30th percentile – i.e., 30% of its contemporaries scored the same or lower than it.