LEADER 06327nam 22008535 450 001 9910484686603321 005 20251226202847.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(BIP)30771379 035 $a(EXLCZ)992670000000028927 100 $a20100625d2010 u| 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, /$fedited by Amihood Amir, Laxmi Parida 205 $a1st ed. 2010. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2010. 215 $a1 online resource (XIII, 362 p. 84 illus.) 225 1 $aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6129 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$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 andDistributed Compressed Indexes. 330 $aThe papers contained in this volume were presented at the 21st Annual S- posium on Combinatorial Pattern Matching (CPM 2010) held at NYU-Poly, Brooklyn, New York during June 21-23, 2010. Allthe paperspresentedatthe conferenceareoriginalresearchcontributions. We received 53 submissions from 21 countries. Each paper was reviewed by at least three reviewers. The committee decided to accept 28 papers. The program also includes three invited talks by Zvi Galil from Tel Aviv University, Israel, Richard M. Karp from University of California at Berkeley, USA, and Je'rey S. Vitter from Texas A&M University, USA. The objective of the annual CPM meetings is to provide an international forum for research in combinatorial pattern matching and related applications. It addresses issues of searching and matching strings and more complicated p- terns such as trees, regular expressions, graphs, point sets, and arrays. The goal is to derive non-trivialcombinatorialproperties of suchstructures and to exploit these properties in order to either achieve superior performance for the cor- sponding computational problems or pinpoint conditions under which searches cannot be performed e'ciently. The meeting also deals with problems in c- putational biology, data compression and data mining, coding, information - trieval, natural language processing and pattern recognition. TheAnnual SymposiumonCombinatorialPatternMatchingstartedin 1990, andhassincetakenplaceeveryyear.PreviousCPM meetingswereheld inParis, London, Tucson, Padova, Asilomar, Helsinki, Laguna Beach, Aarhus, Pisc- away, Warwick, Montreal, Jerusalem, Fukuoka, Morelia, Istanbul, Jeju Island, Barcelona, London, Ontario, Pisa, and Lille. 410 0$aTheoretical Computer Science and General Issues,$x2512-2029 ;$v6129 606 $aPattern recognition systems 606 $aLife sciences 606 $aComputer programming 606 $aAlgorithms 606 $aArtificial intelligence$xData processing 606 $aData mining 606 $aAutomated Pattern Recognition 606 $aLife Sciences 606 $aProgramming Techniques 606 $aAlgorithms 606 $aData Science 606 $aData Mining and Knowledge Discovery 615 0$aPattern recognition systems. 615 0$aLife sciences. 615 0$aComputer programming. 615 0$aAlgorithms. 615 0$aArtificial intelligence$xData processing. 615 0$aData mining. 615 14$aAutomated Pattern Recognition. 615 24$aLife Sciences. 615 24$aProgramming Techniques. 615 24$aAlgorithms. 615 24$aData Science. 615 24$aData Mining and Knowledge Discovery. 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