↓ 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 CPM’s 20th Anniversary: A Statistical Retrospective
  3. Altmetric Badge
    Chapter 2 Quasi-distinct Parsing and Optimal Compression Methods
  4. Altmetric Badge
    Chapter 3 Generalized Substring Compression
  5. Altmetric Badge
    Chapter 4 Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques
  6. Altmetric Badge
    Chapter 5 Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure
  7. Altmetric Badge
    Chapter 6 Linear Time Suffix Array Construction Using D-Critical Substrings
  8. Altmetric Badge
    Chapter 7 On the Value of Multiple Read/Write Streams for Data Compression
  9. Altmetric Badge
    Chapter 8 Reoptimization of the Shortest Common Superstring Problem
  10. Altmetric Badge
    Chapter 9 LCS Approximation via Embedding into Local Non-repetitive Strings
  11. Altmetric Badge
    Chapter 10 An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings
  12. Altmetric Badge
    Chapter 11 Fast Searching in Packed Strings
  13. Altmetric Badge
    Chapter 12 New Complexity Bounds for Image Matching under Rotation and Scaling
  14. Altmetric Badge
    Chapter 13 Online Approximate Matching with Non-local Distances
  15. Altmetric Badge
    Chapter 14 Faster and Space-Optimal Edit Distance “1” Dictionary
  16. Altmetric Badge
    Chapter 15 Approximate Matching for Run-Length Encoded Strings Is 3sum -Hard
  17. Altmetric Badge
    Chapter 16 Modeling and Algorithmic Challenges in Online Social Networks
  18. Altmetric Badge
    Chapter 17 Permuted Longest-Common-Prefix Array
  19. Altmetric Badge
    Chapter 18 Periodic String Comparison
  20. Altmetric Badge
    Chapter 19 Deconstructing Intractability: A Case Study for Interval Constrained Coloring
  21. Altmetric Badge
    Chapter 20 Maximum Motif Problem in Vertex-Colored Graphs
  22. Altmetric Badge
    Chapter 21 Fast RNA Structure Alignment for Crossing Input Structures
  23. Altmetric Badge
    Chapter 22 Sparse RNA Folding: Time and Space Efficient Algorithms
  24. Altmetric Badge
    Chapter 23 Multiple Alignment of Biological Networks: A Flexible Approach
  25. Altmetric Badge
    Chapter 24 Graph Mining: Patterns, Generators and Tools
  26. Altmetric Badge
    Chapter 25 Level- k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time
  27. Altmetric Badge
    Chapter 26 The Structure of Level- k Phylogenetic Networks
  28. Altmetric Badge
    Chapter 27 Finding All Sorting Tandem Duplication Random Loss Operations
  29. Altmetric Badge
    Chapter 28 Average-Case Analysis of Perfect Sorting by Reversals
  30. Altmetric Badge
    Chapter 29 Statistical Properties of Factor Oracles
  31. Altmetric Badge
    Chapter 30 Haplotype Inference Constrained by Plausible Haplotype Data
  32. Altmetric Badge
    Chapter 31 Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract)
Attention for Chapter 30: Haplotype Inference Constrained by Plausible Haplotype Data
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
Haplotype Inference Constrained by Plausible Haplotype Data
Chapter number 30
Book title
Combinatorial Pattern Matching
Published in
Lecture notes in computer science, January 2009
DOI 10.1007/978-3-642-02441-2_30
Book ISBNs
978-3-64-202440-5, 978-3-64-202441-2
Authors

Fellows, Michael R., Hartman, Tzvika, Hermelin, Danny, Landau, Gad M., Rosamond, Frances, Rozenberg, Liat, Michael R. Fellows, Tzvika Hartman, Danny Hermelin, Gad M. Landau, Frances Rosamond, Liat Rozenberg

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

Demographic breakdown

Readers by professional status Count As %
Student > Ph. D. Student 1 50%
Researcher 1 50%
Lecturer > Senior Lecturer 1 50%
Readers by discipline Count As %
Computer Science 3 150%