↓ 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 Probabilistic analysis of generalized suffix trees
  3. Altmetric Badge
    Chapter 2 A language approach to string searching evaluation
  4. Altmetric Badge
    Chapter 3 Pattern matching with mismatches: A probabilistic analysis and a randomized algorithm
  5. Altmetric Badge
    Chapter 4 Fast multiple keyword searching
  6. Altmetric Badge
    Chapter 5 Heaviest increasing/common subsequence problems
  7. Altmetric Badge
    Chapter 6 Approximate regular expression pattern matching with concave gap penalties
  8. Altmetric Badge
    Chapter 7 Matrix longest common subsequence problem, duality and hilbert bases
  9. Altmetric Badge
    Chapter 8 From regular expressions to DFA's using compressed NFA's
  10. Altmetric Badge
    Chapter 9 Identifying periodic occurrences of a template with applications to protein structure
  11. Altmetric Badge
    Chapter 10 Edit distance for genome comparison based on non-local operations
  12. Altmetric Badge
    Chapter 11 3-D substructure matching in protein Molecules
  13. Altmetric Badge
    Chapter 12 Fast serial and parallel algorithms for approximate tree matching with VLDC's (Extended Abstract)
  14. Altmetric Badge
    Chapter 13 Grammatical tree matching
  15. Altmetric Badge
    Chapter 14 Theoretical and empirical comparisons of approximate string matching algorithms
  16. Altmetric Badge
    Chapter 15 Fast and practical approximate string matching
  17. Altmetric Badge
    Chapter 16 DZ A text compression algorithm for natural languages
  18. Altmetric Badge
    Chapter 17 Multiple alignment with guaranteed error bounds and communication cost
  19. Altmetric Badge
    Chapter 18 Two algorithms for the longest common subsequence of three (or more) strings
  20. Altmetric Badge
    Chapter 19 Color Set Size problem with applications to string matching
  21. Altmetric Badge
    Chapter 20 Computing display conflicts in string and circular string visualization
  22. Altmetric Badge
    Chapter 21 Efficient randomized dictionary matching algorithms
  23. Altmetric Badge
    Chapter 22 Dynamic dictionary matching with failure functions
Attention for Chapter 19: Color Set Size problem with applications to string matching
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

Readers on

mendeley
33 Mendeley
citeulike
1 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
Color Set Size problem with applications to string matching
Chapter number 19
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, April 1992
DOI 10.1007/3-540-56024-6_19
Book ISBNs
978-3-54-056024-1, 978-3-54-047357-2
Authors

Lucas Chi, Kwong Hui, Chi, Lucas, Hui, Kwong

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
United States 2 6%
Italy 1 3%
Belgium 1 3%
Portugal 1 3%
Russia 1 3%
China 1 3%
Japan 1 3%
Poland 1 3%
Unknown 24 73%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 16 48%
Researcher 5 15%
Student > Master 3 9%
Professor 3 9%
Student > Postgraduate 2 6%
Other 3 9%
Unknown 1 3%
Readers by discipline Count As %
Computer Science 26 79%
Agricultural and Biological Sciences 2 6%
Engineering 1 3%
Unknown 4 12%
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 04 September 2020.
All research outputs
#8,759,452
of 25,837,817 outputs
Outputs from Lecture notes in computer science
#2,564
of 8,201 outputs
Outputs of similar age
#5,626
of 18,186 outputs
Outputs of similar age from Lecture notes in computer science
#2
of 3 outputs
Altmetric has tracked 25,837,817 research outputs across all sources so far. This one is in the 43rd percentile – i.e., 43% of other outputs scored the same or lower than it.
So far Altmetric has tracked 8,201 research outputs from this source. They typically receive a little more attention than average, with a mean Attention Score of 5.2. This one has gotten more attention than average, scoring higher than 53% 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 18,186 tracked outputs that were published within six weeks on either side of this one in any source. This one is in the 7th percentile – i.e., 7% of its contemporaries scored the same or lower than it.
We're also able to compare this research output to 3 others from the same source and published within six weeks on either side of this one.