LEADER 03931nam 2200613 a 450 001 9910484686603321 005 20200520144314.0 010 $a1-280-38700-9 010 $a9786613564924 010 $a3-642-13509-9 024 7 $a10.1007/978-3-642-13509-5 035 $a(CKB)2670000000028927 035 $a(SSID)ssj0000446342 035 $a(PQKBManifestationID)11299743 035 $a(PQKBTitleCode)TC0000446342 035 $a(PQKBWorkID)10495960 035 $a(PQKB)11491993 035 $a(DE-He213)978-3-642-13509-5 035 $a(MiAaPQ)EBC3065453 035 $a(PPN)149063717 035 $a(EXLCZ)992670000000028927 100 $a20100429d2010 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial pattern matching $e21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 : proceedings /$fAmihood Amir, Laxmi Parida (eds.) 205 $a1st ed. 210 $aNew York $cSpringer$d2010 215 $a1 online resource (XIII, 362 p. 84 illus.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v6129 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-642-13508-0 320 $aIncludes bibliographical references and index. 327 $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. 410 0$aLecture notes in computer science ;$v6129. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 606 $aComputer algorithms$vCongresses 606 $aCombinatorial analysis$vCongresses 615 0$aComputer algorithms 615 0$aCombinatorial analysis 676 $a006.4015116 701 $aAmir$b Amihood$01763662 701 $aParida$b Laxmi$01764183 712 12$aSymposium on Combinatorial Pattern Matching 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910484686603321 996 $aCombinatorial pattern matching$94204930 997 $aUNINA