LEADER 04389nam 2200625 a 450 001 9910768170603321 005 20200520144314.0 010 $a3-540-69068-9 024 7 $a10.1007/978-3-540-69068-9 035 $a(CKB)1000000000440777 035 $a(SSID)ssj0000316693 035 $a(PQKBManifestationID)11923493 035 $a(PQKBTitleCode)TC0000316693 035 $a(PQKBWorkID)10275169 035 $a(PQKB)10115285 035 $a(DE-He213)978-3-540-69068-9 035 $a(MiAaPQ)EBC3068632 035 $a(PPN)127051589 035 $a(EXLCZ)991000000000440777 100 $a20080508d2008 uy 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial pattern matching $e19th annual symposium, CPM 2008, Pisa, Italy, June 18-20, 2008 : proceedings /$fPaolo Ferragina, Gad M. Landau, (eds.) 205 $a1st ed. 2008. 210 $aBerlin $cSpringer$d2008 215 $a1 online resource (XIII, 317 p.) 225 1 $aLecture notes in computer science,$x0302-9743 ;$v5029 225 1 $aLNCS sublibrary. SL 1, Theoretical computer science and general issues 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-69066-2 320 $aIncludes bibliographical references and index. 327 $aInvited Talks -- ReCombinatorics: Combinatorial Algorithms for Studying the History of Recombination in Populations -- Lower Bounds for Succinct Data Structures -- The Changing Face of Web Search -- Contributed Papers -- Two-Dimensional Pattern Matching with Combined Scaling and Rotation -- Searching for Gapped Palindromes -- Parameterized Algorithms and Hardness Results for Some Graph Motif Problems -- Finding Largest Well-Predicted Subset of Protein Structure Models -- HP Distance Via Double Cut and Join Distance -- Fixed Parameter Tractable Alignment of RNA Structures Including Arbitrary Pseudoknots -- Faster Algorithm for the Set Variant of the String Barcoding Problem -- Probabilistic Arithmetic Automata and Their Application to Pattern Matching Statistics -- Analysis of the Size of Antidictionary in DCA -- Approximate String Matching with Address Bit Errors -- On-Line Approximate String Matching with Bounded Errors -- A Black Box for Online Approximate Pattern Matching -- An(other) Entropy-Bounded Compressed Suffix Tree -- On Compact Representations of All-Pairs-Shortest-Path-Distance Matrices -- Computing Inverse ST in Linear Complexity -- Dynamic Fully-Compressed Suffix Trees -- A Linear Delay Algorithm for Building Concept Lattices -- Matching Integer Intervals by Minimal Sets of Binary Words with don?t cares -- Fast Algorithms for Computing Tree LCS -- Why Greed Works for Shortest Common Superstring Problem -- Constrained LCS: Hardness and Approximation -- Finding Additive Biclusters with Random Background -- An Improved Succinct Representation for Dynamic k-ary Trees -- Towards a Solution to the ?Runs? Conjecture -- On the Longest Common Parameterized Subsequence. 330 $aThis book constitutes the refereed proceedings of the 19th Annual Symposium on Combinatorial Pattern Matching, CPM 2008, held in Pisa, Italy, in June 2008. The 25 revised full papers presented together with 3 invited talks were carefully reviewed and selected from 78 submissions. The papers address all areas related to combinatorial pattern matching and its applications, such as 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. 410 0$aLecture notes in computer science ;$v5029. 410 0$aLNCS sublibrary.$nSL 1,$pTheoretical computer science and general issues. 517 3 $aCPM 2008 606 $aComputer algorithms$vCongresses 606 $aCombinatorial analysis$vCongresses 606 $aComputational biology$vCongresses 615 0$aComputer algorithms 615 0$aCombinatorial analysis 615 0$aComputational biology 676 $a006.4 701 $aFerragina$b Paolo$066343 701 $aLandau$b Gad M$0508807 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910768170603321 996 $aCombinatorial pattern matching$94187640 997 $aUNINA