↓ 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 Forty Years of Text Indexing
  3. Altmetric Badge
    Chapter 2 LCP Magic
  4. Altmetric Badge
    Chapter 3 Discrete Methods for Image Analysis Applied to Molecular Biology
  5. Altmetric Badge
    Chapter 4 Locating All Maximal Approximate Runs in a String
  6. Altmetric Badge
    Chapter 5 On Minimal and Maximal Suffixes of a Substring
  7. Altmetric Badge
    Chapter 6 Converting SLP to LZ78 in almost Linear Time
  8. Altmetric Badge
    Chapter 7 A Bit-Parallel, General Integer-Scoring Sequence Alignment Algorithm
  9. Altmetric Badge
    Chapter 8 Compact q-Gram Profiling of Compressed Strings
  10. Altmetric Badge
    Chapter 9 A Constant-Space Comparison-Based Algorithm for Computing the Burrows–Wheeler Transform
  11. Altmetric Badge
    Chapter 10 Pattern Matching with Variables: A Multivariate Complexity Analysis
  12. Altmetric Badge
    Chapter 11 New Algorithms for Position Heaps
  13. Altmetric Badge
    Chapter 12 Document Listing on Repetitive Collections
  14. Altmetric Badge
    Chapter 13 Approximating Shortest Superstring Problem Using de Bruijn Graphs
  15. Altmetric Badge
    Chapter 14 Local Search for String Problems: Brute Force Is Essentially Optimal
  16. Altmetric Badge
    Chapter 15 Space-Efficient Construction Algorithm for the Circular Suffix Tree
  17. Altmetric Badge
    Chapter 16 Efficient Lyndon Factorization of Grammar Compressed Text
  18. Altmetric Badge
    Chapter 17 Approximation of Grammar-Based Compression via Recompression
  19. Altmetric Badge
    Chapter 18 Fast Algorithm for Partial Covers in Words
  20. Altmetric Badge
    Chapter 19 Linear Time Lempel-Ziv Factorization: Simple, Fast, Small
  21. Altmetric Badge
    Chapter 20 External Memory Generalized Suffix and LCP Arrays Construction
  22. Altmetric Badge
    Chapter 21 Efficient All Path Score Computations on Grid Graphs
  23. Altmetric Badge
    Chapter 22 Time-Space Trade-Offs for the Longest Common Substring Problem
  24. Altmetric Badge
    Chapter 23 A Succinct Grammar Compression
  25. Altmetric Badge
    Chapter 24 Data Structure Lower Bounds on Random Access to Grammar-Compressed Strings
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

blogs
1 blog
twitter
2 X users

Citations

dimensions_citation
2 Dimensions

Readers on

mendeley
5 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.
Title
Combinatorial Pattern Matching
Published by
Springer Berlin Heidelberg, May 2013
DOI 10.1007/978-3-642-38905-4
ISBNs
978-3-64-238904-7, 978-3-64-238905-4
Editors

Fischer, Johannes, Sanders, Peter

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

Geographical breakdown

Country Count As %
Brazil 1 20%
Unknown 4 80%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 2 40%
Professor 1 20%
Student > Master 1 20%
Student > Bachelor 1 20%
Readers by discipline Count As %
Computer Science 4 80%
Unspecified 1 20%