rdf-syntax-grammar
mods:
  schema location: http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-2.xsd
  title info:
    title: Combinatorial Pattern Matching
    sub title: 20th Annual Symposium, CPM 2009 Lille, France, June 22-24, 2009 Proceedings
  name:
    name part: Kucherov, Gregory.
    role:
      role term: editor.
  name:
    name part: Ukkonen, Esko.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2009
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIII, 370 p. online resource.
  table of contents: CPM’s 20th Anniversary: A Statistical Retrospective -- Quasi-distinct Parsing and Optimal Compression Methods -- Generalized Substring Compression -- Text Indexing, Suffix Sorting, and Data Compression: Common Problems and Techniques -- Contracted Suffix Trees: A Simple and Dynamic Text Indexing Data Structure -- Linear Time Suffix Array Construction Using D-Critical Substrings -- On the Value of Multiple Read/Write Streams for Data Compression -- Reoptimization of the Shortest Common Superstring Problem -- LCS Approximation via Embedding into Local Non-repetitive Strings -- An Efficient Matching Algorithm for Encoded DNA Sequences and Binary Strings -- Fast Searching in Packed Strings -- New Complexity Bounds for Image Matching under Rotation and Scaling -- Online Approximate Matching with Non-local Distances -- Faster and Space-Optimal Edit Distance “1” Dictionary -- Approximate Matching for Run-Length Encoded Strings Is 3sum-Hard -- Modeling and Algorithmic Challenges in Online Social Networks -- Permuted Longest-Common-Prefix Array -- Periodic String Comparison -- Deconstructing Intractability: A Case Study for Interval Constrained Coloring -- Maximum Motif Problem in Vertex-Colored Graphs -- Fast RNA Structure Alignment for Crossing Input Structures -- Sparse RNA Folding: Time and Space Efficient Algorithms -- Multiple Alignment of Biological Networks: A Flexible Approach -- Graph Mining: Patterns, Generators and Tools -- Level-k Phylogenetic Networks Are Constructable from a Dense Triplet Set in Polynomial Time -- The Structure of Level-k Phylogenetic Networks -- Finding All Sorting Tandem Duplication Random Loss Operations -- Average-Case Analysis of Perfect Sorting by Reversals -- Statistical Properties of Factor Oracles -- Haplotype Inference Constrained by Plausible Haplotype Data -- Efficient Inference of Haplotypes from Genotypes on a Pedigree with Mutations and Missing Alleles (Extented Abstract).
  note: edited by Gregory Kucherov, Esko Ukkonen.
  subject:
    topic: Computer science
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Computers
  subject:
    topic: Algorithms
  subject:
    topic: Information storage and retrieval
  subject:
    topic: Pattern recognition
  subject:
    topic: Bioinformatics
  subject:
    topic: Computer Science
  subject:
    topic: Theory of Computation
  subject:
    topic: Pattern Recognition
  subject:
    topic: Computational Biology/Bioinformatics
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Information Storage and Retrieval
  classification: QA75.5-76.95
  classification: 004.0151
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 5577
  identifier: 9783642024412
  identifier: http://dx.doi.org/10.1007/978-3-642-02441-2
  record info:
    record creation date: 100301
    record change date: 20170118173427.0
    record identifier: 978-3-642-02441-2