↓ 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 for Forest Pattern Matching
  3. Altmetric Badge
    Chapter 2 Affine Image Matching Is Uniform ${\text{\rm TC}^0}$ -Complete
  4. Altmetric Badge
    Chapter 3 Old and New in Stringology
  5. Altmetric Badge
    Chapter 4 Small-Space 2D Compressed Dictionary Matching
  6. Altmetric Badge
    Chapter 5 Bidirectional Search in a String with Wavelet Trees
  7. Altmetric Badge
    Chapter 6 A Minimal Periods Algorithm with Applications
  8. Altmetric Badge
    Chapter 7 The Property Suffix Tree with Dynamic Properties
  9. Altmetric Badge
    Chapter 8 Approximate All-Pairs Suffix/Prefix Overlaps
  10. Altmetric Badge
    Chapter 9 Succinct Dictionary Matching with No Slowdown
  11. Altmetric Badge
    Chapter 10 Pseudo-realtime Pattern Matching: Closing the Gap
  12. Altmetric Badge
    Chapter 11 Breakpoint Distance and PQ-Trees
  13. Altmetric Badge
    Chapter 12 On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs
  14. Altmetric Badge
    Chapter 13 Succinct Representations of Separable Graphs
  15. Altmetric Badge
    Chapter 14 Implicit Hitting Set Problems and Multi-genome Alignment
  16. Altmetric Badge
    Chapter 15 Bounds on the Minimum Mosaic of Population Sequences under Recombination
  17. Altmetric Badge
    Chapter 16 The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection
  18. Altmetric Badge
    Chapter 17 Phylogeny- and Parsimony-Based Haplotype Inference with Constraints
  19. Altmetric Badge
    Chapter 18 Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks
  20. Altmetric Badge
    Chapter 19 Mod/Resc Parsimony Inference
  21. Altmetric Badge
    Chapter 20 Extended Islands of Tractability for Parsimony Haplotyping
  22. Altmetric Badge
    Chapter 21 Sampled Longest Common Prefix Array
  23. Altmetric Badge
    Chapter 22 Verifying a Parameterized Border Array in O ( n 1.5 ) Time
  24. Altmetric Badge
    Chapter 23 Cover Array String Reconstruction
  25. Altmetric Badge
    Chapter 24 Compression, Indexing, and Retrieval for Massive String Data
  26. Altmetric Badge
    Chapter 25 Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality
  27. Altmetric Badge
    Chapter 26 A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach
  28. Altmetric Badge
    Chapter 27 Algorithms for Three Versions of the Shortest Common Superstring Problem
  29. Altmetric Badge
    Chapter 28 Finding Optimal Alignment and Consensus of Circular Strings
  30. Altmetric Badge
    Chapter 29 Optimizing Restriction Site Placement for Synthetic Genomes
  31. Altmetric Badge
    Chapter 30 Extension and Faster Implementation of the GRP Transform for Lossless Compression
  32. Altmetric Badge
    Chapter 31 Parallel and Distributed Compressed Indexes
Attention for Chapter 13: Succinct Representations of Separable Graphs
Altmetric Badge

About this Attention Score

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

Mentioned by

wikipedia
5 Wikipedia pages

Readers on

mendeley
20 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
Succinct Representations of Separable Graphs
Chapter number 13
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, January 2010
DOI 10.1007/978-3-642-13509-5_13
Book ISBNs
978-3-64-213508-8, 978-3-64-213509-5
Authors

Blelloch, Guy E., Farzan, Arash, Guy E. Blelloch, Arash Farzan

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
Japan 1 5%
France 1 5%
Unknown 18 90%

Demographic breakdown

Readers by professional status Count As %
Student > Master 7 35%
Student > Ph. D. Student 5 25%
Researcher 4 20%
Student > Doctoral Student 2 10%
Student > Bachelor 1 5%
Other 0 0%
Unknown 1 5%
Readers by discipline Count As %
Computer Science 16 80%
Engineering 2 10%
Mathematics 1 5%
Unknown 1 5%
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 24 April 2022.
All research outputs
#7,522,616
of 22,958,253 outputs
Outputs from Lecture notes in computer science
#2,489
of 8,135 outputs
Outputs of similar age
#48,734
of 164,711 outputs
Outputs of similar age from Lecture notes in computer science
#45
of 188 outputs
Altmetric has tracked 22,958,253 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,135 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 164,711 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 21st percentile – i.e., 21% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 188 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 60% of its contemporaries.