03931nam 2200613 a 450 991048468660332120200520144314.01-280-38700-997866135649243-642-13509-910.1007/978-3-642-13509-5(CKB)2670000000028927(SSID)ssj0000446342(PQKBManifestationID)11299743(PQKBTitleCode)TC0000446342(PQKBWorkID)10495960(PQKB)11491993(DE-He213)978-3-642-13509-5(MiAaPQ)EBC3065453(PPN)149063717(EXLCZ)99267000000002892720100429d2010 uy 0engurnn|008mamaatxtccrCombinatorial pattern matching 21st Annual Symposium, CPM 2010, New York, NY, USA, June 21-23, 2010 : proceedings /Amihood Amir, Laxmi Parida (eds.)1st ed.New York Springer20101 online resource (XIII, 362 p. 84 illus.) Lecture notes in computer science,0302-9743 ;6129LNCS sublibrary. SL 1, Theoretical computer science and general issuesBibliographic Level Mode of Issuance: Monograph3-642-13508-0 Includes bibliographical references and index.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.Lecture notes in computer science ;6129.LNCS sublibrary.SL 1,Theoretical computer science and general issues.Computer algorithmsCongressesCombinatorial analysisCongressesComputer algorithmsCombinatorial analysis006.4015116Amir Amihood1763662Parida Laxmi1764183Symposium on Combinatorial Pattern MatchingMiAaPQMiAaPQMiAaPQBOOK9910484686603321Combinatorial pattern matching4204930UNINA