LEADER 04607nam 22007935 450 001 9910143595703321 005 20200706094449.0 010 $a3-540-48194-X 024 7 $a10.1007/3-540-48194-X 035 $a(CKB)1000000000211499 035 $a(SSID)ssj0000316691 035 $a(PQKBManifestationID)11923492 035 $a(PQKBTitleCode)TC0000316691 035 $a(PQKBWorkID)10275361 035 $a(PQKB)11033348 035 $a(DE-He213)978-3-540-48194-2 035 $a(MiAaPQ)EBC3062302 035 $a(MiAaPQ)EBC6281171 035 $z(PPN)12372015X 035 $a(PPN)155225030 035 $a(EXLCZ)991000000000211499 100 $a20100301d2001 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $e12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings /$fedited by Amihood Amir, Gad M. Landau 205 $a1st ed. 2001. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2001. 215 $a1 online resource (VIII, 280 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2089 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-42271-4 320 $aIncludes bibliographical references and index. 327 $aRegular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings ? Hydrophobic Cores in the FCC. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2089 606 $aPattern recognition 606 $aAlgorithms 606 $aInformation storage and retrieval 606 $aCoding theory 606 $aInformation theory 606 $aCombinatorics 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aPattern recognition. 615 0$aAlgorithms. 615 0$aInformation storage and retrieval. 615 0$aCoding theory. 615 0$aInformation theory. 615 0$aCombinatorics. 615 14$aPattern Recognition. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aInformation Storage and Retrieval. 615 24$aCoding and Information Theory. 615 24$aCombinatorics. 676 $a005.1 702 $aAmir$b Amihood$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aLandau$b Gad M$4edt$4http://id.loc.gov/vocabulary/relators/edt 801 0$bMiAaPQ 801 1$bMiAaPQ 801 2$bMiAaPQ 906 $aBOOK 912 $a9910143595703321 996 $aCombinatorial Pattern Matching$9772744 997 $aUNINA