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: 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings
  name:
    name part: Amir, Amihood.
    role:
      role term: editor.
  name:
    name part: Parida, Laxmi.
    role:
      role term: editor.
  name:
    name part: SpringerLink (Online service)
  type of resource: text
  origin info:
    place:
      place term: gw
    date issued: 2010
    issuance: monographic
  language:
    language term: eng
  physical description:
    form: electronic
    form: electronic resource
    reformatting quality: access
    form: remote
    extent: XIII, 362 p. 84 illus. online resource.
  table of contents: Algorithms for Forest Pattern Matching -- Affine Image Matching Is Uniform -Complete -- Old and New in Stringology -- Small-Space 2D Compressed Dictionary Matching -- Bidirectional Search in a String with Wavelet Trees -- A Minimal Periods Algorithm with Applications -- The Property Suffix Tree with Dynamic Properties -- Approximate All-Pairs Suffix/Prefix Overlaps -- Succinct Dictionary Matching with No Slowdown -- Pseudo-realtime Pattern Matching: Closing the Gap -- Breakpoint Distance and PQ-Trees -- On the Parameterized Complexity of Some Optimization Problems Related to Multiple-Interval Graphs -- Succinct Representations of Separable Graphs -- Implicit Hitting Set Problems and Multi-genome Alignment -- Bounds on the Minimum Mosaic of Population Sequences under Recombination -- The Highest Expected Reward Decoding for HMMs with Application to Recombination Detection -- Phylogeny- and Parsimony-Based Haplotype Inference with Constraints -- Faster Computation of the Robinson-Foulds Distance between Phylogenetic Networks -- Mod/Resc Parsimony Inference -- Extended Islands of Tractability for Parsimony Haplotyping -- Sampled Longest Common Prefix Array -- Verifying a Parameterized Border Array in O(n 1.5) Time -- Cover Array String Reconstruction -- Compression, Indexing, and Retrieval for Massive String Data -- Building the Minimal Automaton of A * X in Linear Time, When X Is of Bounded Cardinality -- A Compact Representation of Nondeterministic (Suffix) Automata for the Bit-Parallel Approach -- Algorithms for Three Versions of the Shortest Common Superstring Problem -- Finding Optimal Alignment and Consensus of Circular Strings -- Optimizing Restriction Site Placement for Synthetic Genomes -- Extension and Faster Implementation of the GRP Transform for Lossless Compression -- Parallel and Distributed Compressed Indexes.
  note: edited by Amihood Amir, Laxmi Parida.
  subject:
    topic: Computer science
  subject:
    topic: Computer programming
  subject:
    topic: Data structures (Computer science)
  subject:
    topic: Algorithms
  subject:
    topic: Data mining
  subject:
    topic: Pattern recognition
  subject:
    topic: Life sciences
  subject:
    topic: Computer Science
  subject:
    topic: Pattern Recognition
  subject:
    topic: Life Sciences, general
  subject:
    topic: Programming Techniques
  subject:
    topic: Algorithm Analysis and Problem Complexity
  subject:
    topic: Data Structures
  subject:
    topic: Data Mining and Knowledge Discovery
  classification: Q337.5
  classification: TK7882.P3
  classification: 006.4
  related item:
    title info:
      title: Springer eBooks
  related item:
    title info:
      title: Lecture Notes in Computer Science, 6129
  identifier: 9783642135095
  identifier: http://dx.doi.org/10.1007/978-3-642-13509-5
  record info:
    record creation date: 100625
    record change date: 20151204143249.0
    record identifier: 978-3-642-13509-5