Coverart for item
The Resource Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings, Amihood Amir, Laxmi Parida (eds.)

Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings, Amihood Amir, Laxmi Parida (eds.)

Label
Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings
Title
Combinatorial pattern matching
Title remainder
21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings
Statement of responsibility
Amihood Amir, Laxmi Parida (eds.)
Creator
Contributor
Subject
Genre
Language
eng
Summary
Annotation
Member of
Cataloging source
GW5XE
Dewey number
006.4015116
Illustrations
illustrations
Index
index present
LC call number
TK7882.P3
LC item number
C66 2010
Literary form
non fiction
http://bibfra.me/vocab/lite/meetingDate
2010
http://bibfra.me/vocab/lite/meetingName
CPM (Symposium)
Nature of contents
  • dictionaries
  • bibliography
NLM call number
QA 76.9.A43
http://library.link/vocab/relatedWorkOrContributorName
  • Amir, Amihood
  • Parida, Laxmi
Series statement
Lecture notes in computer science,
Series volume
6129
http://library.link/vocab/subjectName
  • Pattern perception
  • Algorithms
  • Computing Methodologies
  • Perception des structures
  • Mustervergleich
  • Perception des structures
  • Pattern perception
  • Informatique
  • Pattern perception
  • Mustervergleich
Summary expansion
This book constitutes the refereed proceedings of the 21st Annual Symposium on Combinatorial Pattern Matching, CPM 2010, held in New York, USA, in June 2010. The 28 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 53 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as searching and matching strings and more complicated patterns such as trees, regular expressions, graphs, point sets, and arrays with special focus on coding and data compression, computational biology, data mining, information retrieval, natural language processing, pattern recognition, string algorithms, string processing in databases, symbolic computing and text searching
Label
Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings, Amihood Amir, Laxmi Parida (eds.)
Instantiates
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
654396267
Dimensions
unknown
Extent
1 online resource (xiii, 362 pages)
Form of item
online
Isbn
9783642135095
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-13509-5
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-13508-8
Specific material designation
remote
System control number
(OCoLC)654396267
Label
Combinatorial pattern matching : 21st annual symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 ; proceedings, Amihood Amir, Laxmi Parida (eds.)
Publication
Bibliography note
Includes bibliographical references and index
Carrier category
online resource
Carrier category code
  • cr
Carrier MARC source
rdacarrier
Color
multicolored
Content category
text
Content type code
  • txt
Content type MARC source
rdacontent
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
Control code
654396267
Dimensions
unknown
Extent
1 online resource (xiii, 362 pages)
Form of item
online
Isbn
9783642135095
Media category
computer
Media MARC source
rdamedia
Media type code
  • c
Other control number
10.1007/978-3-642-13509-5
Other physical details
illustrations
http://library.link/vocab/ext/overdrive/overdriveId
978-3-642-13508-8
Specific material designation
remote
System control number
(OCoLC)654396267

Library Locations

    • Ellis LibraryBorrow it
      1020 Lowry Street, Columbia, MO, 65201, US
      38.944491 -92.326012
    • Engineering Library & Technology CommonsBorrow it
      W2001 Lafferre Hall, Columbia, MO, 65211, US
      38.946102 -92.330125
Processing Feedback ...