↓ 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 A Combinatorial Approach to Genome-Wide Ortholog Assignment: Beyond Sequence Similarity Search
  3. Altmetric Badge
    Chapter 2 Stringology: Some Classic and Some Modern Problems
  4. Altmetric Badge
    Chapter 3 Algorithmic Problems in Scheduling Jobs on Variable-Speed Processors
  5. Altmetric Badge
    Chapter 4 Speeding Up HMM Decoding and Training by Exploiting Sequence Repetitions
  6. Altmetric Badge
    Chapter 5 On Demand String Sorting over Unbounded Alphabets
  7. Altmetric Badge
    Chapter 6 Finding Witnesses by Peeling
  8. Altmetric Badge
    Chapter 7 Cache-Oblivious Index for Approximate String Matching
  9. Altmetric Badge
    Chapter 8 Improved Approximate String Matching and Regular Expression Matching on Ziv-Lempel Compressed Texts
  10. Altmetric Badge
    Chapter 9 Self-normalised Distance with Don’t Cares
  11. Altmetric Badge
    Chapter 10 Move-to-Front, Distance Coding, and Inversion Frequencies Revisited
  12. Altmetric Badge
    Chapter 11 A Lempel-Ziv Text Index on Secondary Storage
  13. Altmetric Badge
    Chapter 12 Dynamic Rank-Select Structures with Applications to Run-Length Encoded Texts
  14. Altmetric Badge
    Chapter 13 Most Burrows-Wheeler Based Compressors Are Not Optimal
  15. Altmetric Badge
    Chapter 14 Non-breaking Similarity of Genomes with Gene Repetitions
  16. Altmetric Badge
    Chapter 15 A New and Faster Method of Sorting by Transpositions
  17. Altmetric Badge
    Chapter 16 Finding Compact Structural Motifs
  18. Altmetric Badge
    Chapter 17 Improved Algorithms for Inferring the Minimum Mosaic of a Set of Recombinants
  19. Altmetric Badge
    Chapter 18 Computing Exact p-Value for Structured Motif
  20. Altmetric Badge
    Chapter 19 Improved Sketching of Hamming Distance with Error Correcting
  21. Altmetric Badge
    Chapter 20 Deterministic Length Reduction: Fast Convolution in Sparse Data and Applications
  22. Altmetric Badge
    Chapter 21 Guided Forest Edit Distance: Better Structure Comparisons by Using Domain-knowledge
  23. Altmetric Badge
    Chapter 22 Space-Efficient Algorithms for Document Retrieval
  24. Altmetric Badge
    Chapter 23 Compressed Text Indexes with Fast Locate
  25. Altmetric Badge
    Chapter 24 Processing Compressed Texts: A Tractability Border
  26. Altmetric Badge
    Chapter 25 Common Structured Patterns in Linear Graphs: Approximation and Combinatorics
  27. Altmetric Badge
    Chapter 26 Identification of Distinguishing Motifs
  28. Altmetric Badge
    Chapter 27 Algorithms for Computing the Longest Parameterized Common Subsequence
  29. Altmetric Badge
    Chapter 28 Fixed-Parameter Tractability of the Maximum Agreement Supertree Problem
  30. Altmetric Badge
    Chapter 29 Two-Dimensional Range Minimum Queries
  31. Altmetric Badge
    Chapter 30 Tiling Periodicity
  32. Altmetric Badge
    Chapter 31 Fast and Practical Algorithms for Computing All the Runs in a String
  33. Altmetric Badge
    Chapter 32 Longest Common Separable Pattern Among Permutations
  34. Altmetric Badge
    Chapter 33 Suffix Arrays on Words
  35. Altmetric Badge
    Chapter 34 Efficient Computation of Substring Equivalence Classes with Suffix Arrays
  36. Altmetric Badge
    Chapter 35 A Simple Construction of Two-Dimensional Suffix Trees in Linear Time
Attention for Chapter 2: Stringology: Some Classic and Some Modern Problems
Altmetric Badge

Citations

dimensions_citation
1 Dimensions

Readers on

mendeley
2 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
Stringology: Some Classic and Some Modern Problems
Chapter number 2
Book title
Combinatorial Pattern Matching
Published by
Springer, Berlin, Heidelberg, July 2007
DOI 10.1007/978-3-540-73437-6_2
Book ISBNs
978-3-54-073436-9, 978-3-54-073437-6
Authors

S. Muthukrishnan, Muthukrishnan, S.

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 %
France 1 50%
Unknown 1 50%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Researcher 1 50%
Readers by discipline Count As %
Computer Science 2 100%