↓ 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 Sharper Upper and Lower Bounds for an Approximation Scheme for Consensus-Pattern
  3. Altmetric Badge
    Chapter 2 On the Longest Common Rigid Subsequence Problem
  4. Altmetric Badge
    Chapter 3 Text Indexing with Errors
  5. Altmetric Badge
    Chapter 4 A New Compressed Suffix Tree Supporting Fast Search and Its Construction Algorithm Using Optimal Working Space
  6. Altmetric Badge
    Chapter 5 Succinct Suffix Arrays Based on Run-Length Encoding
  7. Altmetric Badge
    Chapter 6 Linear-Time Construction of Compressed Suffix Arrays Using o ( n log n )-Bit Working Space for Large Alphabets
  8. Altmetric Badge
    Chapter 7 Faster Algorithms for δ , γ -Matching and Related Problems
  9. Altmetric Badge
    Chapter 8 A Fast Algorithm for Approximate String Matching on Gene Sequences
  10. Altmetric Badge
    Chapter 9 Approximate Matching in the L 1 Metric
  11. Altmetric Badge
    Chapter 10 An Efficient Algorithm for Generating Super Condensed Neighborhoods
  12. Altmetric Badge
    Chapter 11 The Median Problem for the Reversal Distance in Circular Bacterial Genomes
  13. Altmetric Badge
    Chapter 12 Using PQ Trees for Comparative Genomics
  14. Altmetric Badge
    Chapter 13 Hardness of Optimal Spaced Seed Design
  15. Altmetric Badge
    Chapter 14 Weighted Directed Word Graph
  16. Altmetric Badge
    Chapter 15 Construction of Aho Corasick Automaton in Linear Time for Integer Alphabets
  17. Altmetric Badge
    Chapter 16 An Extension of the Burrows Wheeler Transform and Applications to Sequence Comparison and Data Compression
  18. Altmetric Badge
    Chapter 17 DNA Compression Challenge Revisited: A Dynamic Programming Approach
  19. Altmetric Badge
    Chapter 18 On the Complexity of Sparse Exon Assembly
  20. Altmetric Badge
    Chapter 19 An Upper Bound on the Hardness of Exact Matrix Based Motif Discovery
  21. Altmetric Badge
    Chapter 20 Incremental Inference of Relational Motifs with a Degenerate Alphabet
  22. Altmetric Badge
    Chapter 21 Speeding up Parsing of Biological Context-Free Grammars
  23. Altmetric Badge
    Chapter 22 A New Periodicity Lemma
  24. Altmetric Badge
    Chapter 23 Two Dimensional Parameterized Matching
  25. Altmetric Badge
    Chapter 24 An Optimal Algorithm for Online Square Detection
  26. Altmetric Badge
    Chapter 25 A Simple Fast Hybrid Pattern-Matching Algorithm
  27. Altmetric Badge
    Chapter 26 Prefix-Free Regular-Expression Matching
  28. Altmetric Badge
    Chapter 27 Reducing the Size of NFAs by Using Equivalences and Preorders
  29. Altmetric Badge
    Chapter 28 Regular Expression Constrained Sequence Alignment
  30. Altmetric Badge
    Chapter 29 A Linear Tree Edit Distance Algorithm for Similar Ordered Trees
  31. Altmetric Badge
    Chapter 30 A Polynomial Time Matching Algorithm of Ordered Tree Patterns Having Height-Constrained Variables
  32. Altmetric Badge
    Chapter 31 Assessing the Significance of Sets of Words
  33. Altmetric Badge
    Chapter 32 Inferring a Graph from Path Frequency
  34. Altmetric Badge
    Chapter 33 Exact and Approximation Algorithms for DNA Tag Set Design
  35. Altmetric Badge
    Chapter 34 Parametric Analysis for Ungapped Markov Models of Evolution
  36. Altmetric Badge
    Chapter 35 Linear Programming for Phylogenetic Reconstruction Based on Gene Rearrangements
  37. Altmetric Badge
    Chapter 36 Identifying Similar Surface Patches on Proteins Using a Spin-Image Surface Representation
  38. Altmetric Badge
    Chapter 37 Mass Spectra Alignments and Their Significance
Attention for Chapter 17: DNA Compression Challenge Revisited: A Dynamic Programming Approach
Altmetric Badge

Mentioned by

patent
2 patents

Citations

dimensions_citation
5 Dimensions

Readers on

mendeley
15 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
DNA Compression Challenge Revisited: A Dynamic Programming Approach
Chapter number 17
Book title
Combinatorial Pattern Matching
Published by
Springer, Berlin, Heidelberg, June 2005
DOI 10.1007/11496656_17
Book ISBNs
978-3-54-026201-5, 978-3-54-031562-9
Authors

Behshad Behzadi, Fabrice Le Fessant, Behzadi, Behshad, Le Fessant, Fabrice

Mendeley readers

Mendeley readers

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

Geographical breakdown

Country Count As %
France 1 7%
Unknown 14 93%

Demographic breakdown

Readers by professional status Count As %
Researcher 3 20%
Student > Ph. D. Student 3 20%
Professor 2 13%
Professor > Associate Professor 2 13%
Student > Doctoral Student 1 7%
Other 2 13%
Unknown 2 13%
Readers by discipline Count As %
Computer Science 12 80%
Medicine and Dentistry 1 7%
Unknown 2 13%