↓ 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 Multiple Genome Alignment: Chaining Algorithms Revisited
  3. Altmetric Badge
    Chapter 2 Two-Dimensional Pattern Matching with Rotations
  4. Altmetric Badge
    Chapter 3 An Improved Algorithm for Generalized Comparison of Minisatellites
  5. Altmetric Badge
    Chapter 4 Optimal Spaced Seeds for Hidden Markov Models, with Application to Homologous Coding Regions
  6. Altmetric Badge
    Chapter 5 Fast Lightweight Suffix Array Construction and Checking
  7. Altmetric Badge
    Chapter 6 Distributed and Paged Suffix Trees for Large Genetic Databases
  8. Altmetric Badge
    Chapter 7 Analysis of Tree Edit Distance Algorithms
  9. Altmetric Badge
    Chapter 8 An Exact and Polynomial Distance-Based Algorithm to Reconstruct Single Copy Tandem Duplication Trees
  10. Altmetric Badge
    Chapter 9 Average-Optimal Multiple Approximate String Matching
  11. Altmetric Badge
    Chapter 10 Optimal Partitions of Strings: A New Class of Burrows-Wheeler Compression Algorithms
  12. Altmetric Badge
    Chapter 11 Haplotype Inference by Pure Parsimony
  13. Altmetric Badge
    Chapter 12 A Simpler 1.5-Approximation Algorithm for Sorting by Transpositions
  14. Altmetric Badge
    Chapter 13 Efficient Data Structures and a New Randomized Approach for Sorting Signed Permutations by Reversals
  15. Altmetric Badge
    Chapter 14 Linear-Time Construction of Suffix Arrays
  16. Altmetric Badge
    Chapter 15 Space Efficient Linear Time Construction of Suffix Arrays
  17. Altmetric Badge
    Chapter 16 Tuning String Matching for Huge Pattern Sets
  18. Altmetric Badge
    Chapter 17 Sparse LCS Common Substring Alignment
  19. Altmetric Badge
    Chapter 18 On Minimizing Pattern Splitting in Multi-track String Matching
  20. Altmetric Badge
    Chapter 19 Alignment between Two Multiple Alignments
  21. Altmetric Badge
    Chapter 20 An Effective Algorithm for the Peptide De Novo Sequencing from MS/MS Spectrum
  22. Altmetric Badge
    Chapter 21 Pattern Discovery in RNA Secondary Structure Using Affix Trees
  23. Altmetric Badge
    Chapter 22 More Efficient Left-to-Right Pattern Matching in Non-sequential Equational Programs
  24. Altmetric Badge
    Chapter 23 Complexities of the Centre and Median String Problems
  25. Altmetric Badge
    Chapter 24 Extracting Approximate Patterns
  26. Altmetric Badge
    Chapter 25 A Fully Linear-Time Approximation Algorithm for Grammar-Based Compression
  27. Altmetric Badge
    Chapter 26 Constrained Tree Inclusion
  28. Altmetric Badge
    Chapter 27 Working on the Problem of Sorting by Transpositions on Genome Rearrangements
  29. Altmetric Badge
    Chapter 28 Efficient Selection of Unique and Popular Oligos for Large EST Databases
Overall attention for this book and its chapters
Altmetric Badge

Mentioned by

wikipedia
2 Wikipedia pages

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.
Title
Combinatorial Pattern Matching
Published by
Springer, Berlin, Heidelberg, January 2003
DOI 10.1007/3-540-44888-8
ISBNs
978-3-54-040311-1, 978-3-54-044888-4
Editors

Ricardo Baeza-Yates, Edgar Chávez, Maxime Crochemore

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 %
Professor 2 100%
Readers by discipline Count As %
Computer Science 2 100%