↓ Skip to main content
What is this page? Embed badge

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 On the Efficiency of the Hamming C-Centerstring Problems
  3. Altmetric Badge
    Chapter 2 Dictionary Matching with One Gap
  4. Altmetric Badge
    Chapter 3 Approximate On-line Palindrome Recognition, and Applications
  5. Altmetric Badge
    Chapter 4 Computing Minimal and Maximal Suffixes of a Substring Revisited
  6. Altmetric Badge
    Chapter 5 Compressed Subsequence Matching and Packed Tree Coloring
  7. Altmetric Badge
    Chapter 6 Reversal Distances for Strings with Few Blocks or Small Alphabets
  8. Altmetric Badge
    Chapter 7 On Combinatorial Generation of Prefix Normal Words
  9. Altmetric Badge
    Chapter 8 Permuted Scaled Matching
  10. Altmetric Badge
    Chapter 9 The Worst Case Complexity of Maximum Parsimony
  11. Altmetric Badge
    Chapter 10 From Indexing Data Structures to de Bruijn Graphs
  12. Altmetric Badge
    Chapter 11 Randomized and Parameterized Algorithms for the Closest String Problem
  13. Altmetric Badge
    Chapter 12 Indexed Geometric Jumbled Pattern Matching
  14. Altmetric Badge
    Chapter 13 An Improved Query Time for Succinct Dynamic Dictionary Matching
  15. Altmetric Badge
    Chapter 14 Order-Preserving Pattern Matching with k Mismatches
  16. Altmetric Badge
    Chapter 15 Parameterized Complexity Analysis for the Closest String with Wildcards Problem
  17. Altmetric Badge
    Chapter 16 Computing Palindromic Factorizations and Palindromic Covers On-line
  18. Altmetric Badge
    Chapter 17 Compactness-Preserving Mapping on Trees
  19. Altmetric Badge
    Chapter 18 Shortest Unique Substring Query Revisited
  20. Altmetric Badge
    Chapter 19 A really Simple Approximation of Smallest Grammar
  21. Altmetric Badge
    Chapter 20 Efficient Algorithms for Shortest Partial Seeds in Words
  22. Altmetric Badge
    Chapter 21 Computing k -th Lyndon Word and Decoding Lexicographically Minimal de Bruijn Sequence
  23. Altmetric Badge
    Chapter 22 Searching of Gapped Repeats and Subrepetitions in a Word
  24. Altmetric Badge
    Chapter 23 Approximate String Matching Using a Bidirectional Index
  25. Altmetric Badge
    Chapter 24 String Range Matching
  26. Altmetric Badge
    Chapter 25 On Hardness of Several String Indexing Problems
  27. Altmetric Badge
    Chapter 26 Most Recent Match Queries in On-Line Suffix Trees
  28. Altmetric Badge
    Chapter 27 Encodings for Range Majority Queries
  29. Altmetric Badge
    Chapter 28 On the DCJ Median Problem
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

twitter
1 X user
wikipedia
2 Wikipedia pages

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
2 Mendeley
Summary X Wikipedia Dimensions citations
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.
Title
Combinatorial Pattern Matching
Published by
Springer International Publishing, June 2014
DOI 10.1007/978-3-319-07566-2
ISBNs
978-3-31-907565-5, 978-3-31-907566-2
Editors

Kulikov, Alexander S., Kuznetsov, Sergei O., Pevzner, Pavel

View on publisher site
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 2 Mendeley readers of this research output. Click here to see the associated Mendeley record.

Geographical breakdown

Country Count As %
Unknown 2 100%

Demographic breakdown

Readers by professional status Count As %
Researcher 2 100%
Readers by discipline Count As %
Computer Science 2 100%

This page is provided by Altmetric.