↓ 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 Identifying and Filtering Near-Duplicate Documents
  3. Altmetric Badge
    Chapter 2 Machine Learning for Efficient Natural-Language Processing
  4. Altmetric Badge
    Chapter 3 Browsing around a Digital Library: Today and Tomorrow
  5. Altmetric Badge
    Chapter 4 Algorithmic Aspects of Speech Recognition: A Synopsis
  6. Altmetric Badge
    Chapter 5 Some Results on Flexible-Pattern Discovery
  7. Altmetric Badge
    Chapter 6 Explaining and Controlling Ambiguity in Dynamic Programming
  8. Altmetric Badge
    Chapter 7 A Dynamic Edit Distance Table
  9. Altmetric Badge
    Chapter 8 Parametric Multiple Sequence Alignment and Phylogeny Construction
  10. Altmetric Badge
    Chapter 9 Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment
  11. Altmetric Badge
    Chapter 10 A Polynomial Time Approximation Scheme for the Closest Substring Problem
  12. Altmetric Badge
    Chapter 11 Approximation Algorithms for Hamming Clustering Problems
  13. Altmetric Badge
    Chapter 12 Approximating the Maximum Isomorphic Agreement Subtree Is Hard
  14. Altmetric Badge
    Chapter 13 A Faster and Unifying Algorithm for Comparing Trees
  15. Altmetric Badge
    Chapter 14 Incomplete Directed Perfect Phylogeny
  16. Altmetric Badge
    Chapter 15 The Longest Common Subsequence Problem for Arc-Annotated Sequences
  17. Altmetric Badge
    Chapter 16 Boyer—Moore String Matching over Ziv-Lempel Compressed Text
  18. Altmetric Badge
    Chapter 17 A Boyer—Moore Type Algorithm for Compressed Pattern Matching
  19. Altmetric Badge
    Chapter 18 Approximate String Matching over Ziv—Lempel Compressed Text
  20. Altmetric Badge
    Chapter 19 Improving Static Compression Schemes by Alphabet Extension
  21. Altmetric Badge
    Chapter 20 Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments
  22. Altmetric Badge
    Chapter 21 A Lower Bound for the Breakpoint Phylogeny Problem
  23. Altmetric Badge
    Chapter 22 Structural Properties and Tractability Results for Linear Synteny
  24. Altmetric Badge
    Chapter 23 Shift Error Detection in Standardized Exams
  25. Altmetric Badge
    Chapter 24 An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC)
  26. Altmetric Badge
    Chapter 25 The Combinatorial Partitioning Method
  27. Altmetric Badge
    Chapter 26 Compact Suffix Array
  28. Altmetric Badge
    Chapter 27 Linear Bidirectional On-Line Construction of Affix Trees
  29. Altmetric Badge
    Chapter 28 Using Suffix Trees for Gapped Motif Discovery
  30. Altmetric Badge
    Chapter 29 Indexing Text with Approximate q -Grams
  31. Altmetric Badge
    Chapter 30 Simple Optimal String Matching Algorithm
  32. Altmetric Badge
    Chapter 31 Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts
  33. Altmetric Badge
    Chapter 32 Periods and Quasiperiods Characterization
  34. Altmetric Badge
    Chapter 33 Finding Maximal Quasiperiodicities in Strings
  35. Altmetric Badge
    Chapter 34 On the Complexity of Determining the Period of a String
Attention for Chapter 7: A Dynamic Edit Distance Table
Altmetric Badge

Citations

dimensions_citation
3 Dimensions

Readers on

mendeley
8 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
A Dynamic Edit Distance Table
Chapter number 7
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, June 2000
DOI 10.1007/3-540-45123-4_7
Book ISBNs
978-3-54-067633-1, 978-3-54-045123-5
Authors

Sung -Ryul Kim, Kunsoo Park

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
India 1 13%
Unknown 7 88%

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 4 50%
Researcher 2 25%
Student > Bachelor 1 13%
Unknown 1 13%
Readers by discipline Count As %
Computer Science 5 63%
Mathematics 1 13%
Agricultural and Biological Sciences 1 13%
Unknown 1 13%