000 04603nam a22005655i 4500
001 978-3-642-13509-5
003 DE-He213
005 20140220084538.0
007 cr nn 008mamaa
008 100625s2010 gw | s |||| 0|eng d
020 _a9783642135095
_9978-3-642-13509-5
024 7 _a10.1007/978-3-642-13509-5
_2doi
050 4 _aQA76.9.A43
072 7 _aUMB
_2bicssc
072 7 _aCOM051300
_2bisacsh
082 0 4 _a005.1
_223
100 1 _aAmir, Amihood.
_eeditor.
245 1 0 _aCombinatorial Pattern Matching
_h[electronic resource] :
_b21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010. Proceedings /
_cedited by Amihood Amir, Laxmi Parida.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg,
_c2010.
300 _aXIII, 362p. 84 illus.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6129
505 0 _aAlgorithms 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.
520 _aThis 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.
650 0 _aComputer science.
650 0 _aData structures (Computer science).
650 0 _aComputer software.
650 0 _aData mining.
650 0 _aOptical pattern recognition.
650 0 _aBioinformatics.
650 1 4 _aComputer Science.
650 2 4 _aAlgorithm Analysis and Problem Complexity.
650 2 4 _aData Structures.
650 2 4 _aData Mining and Knowledge Discovery.
650 2 4 _aPattern Recognition.
650 2 4 _aComputational Biology/Bioinformatics.
650 2 4 _aBioinformatics.
700 1 _aParida, Laxmi.
_eeditor.
710 2 _aSpringerLink (Online service)
773 0 _tSpringer eBooks
776 0 8 _iPrinted edition:
_z9783642135088
830 0 _aLecture Notes in Computer Science,
_x0302-9743 ;
_v6129
856 4 0 _uhttp://dx.doi.org/10.1007/978-3-642-13509-5
912 _aZDB-2-SCS
912 _aZDB-2-LNC
999 _c112274
_d112274