LEADER 06022nam 22007935 450 001 9910143628703321 005 20251116234105.0 010 $a3-540-45123-4 024 7 $a10.1007/3-540-45123-4 035 $a(CKB)1000000000211264 035 $a(SSID)ssj0000321916 035 $a(PQKBManifestationID)11246234 035 $a(PQKBTitleCode)TC0000321916 035 $a(PQKBWorkID)10281101 035 $a(PQKB)10222688 035 $a(DE-He213)978-3-540-45123-5 035 $a(MiAaPQ)EBC3072461 035 $a(PPN)155196014 035 $a(BIP)13638305 035 $a(BIP)6578111 035 $a(EXLCZ)991000000000211264 100 $a20121227d2000 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching $e11th Annual Symposium. CPM 2000, Montreal, Canada, June 21-23, 2000, Proceedings /$fedited by Raffaele Giancarlo, David Sankoff 205 $a1st ed. 2000. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2000. 215 $a1 online resource (XI, 426 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1848 300 $aBibliographic Level Mode of Issuance: Monograph 311 08$a3-540-67633-3 320 $aIncludes bibliographical references at the end of each chapters and index. 327 $aInvited Lectures -- Identifying and Filtering Near-Duplicate Documents -- Machine Learning for Efficient Natural-Language Processing -- Browsing around a Digital Library: Today and Tomorrow -- Summer School Lectures -- Algorithmic Aspects of Speech Recognition: A Synopsis -- Some Results on Flexible-Pattern Discovery -- Contributed Papers -- Explaining and Controlling Ambiguity in Dynamic Programming -- A Dynamic Edit Distance Table -- Parametric Multiple Sequence Alignment and Phylogeny Construction -- Tsukuba BB: A Branch and Bound Algorithm for Local Multiple Sequence Alignment -- A Polynomial Time Approximation Scheme for the Closest Substring Problem -- Approximation Algorithms for Hamming Clustering Problems -- Approximating the Maximum Isomorphic Agreement Subtree Is Hard -- A Faster and Unifying Algorithm for Comparing Trees -- Incomplete Directed Perfect Phylogeny -- The Longest Common Subsequence Problem for Arc-Annotated Sequences -- Boyer?Moore String Matching over Ziv-Lempel Compressed Text -- A Boyer?Moore Type Algorithm for Compressed Pattern Matching -- Approximate String Matching over Ziv?Lempel Compressed Text -- Improving Static Compression Schemes by Alphabet Extension -- Genome Rearrangement by Reversals and Insertions/Deletions of Contiguous Segments -- A Lower Bound for the Breakpoint Phylogeny Problem -- Structural Properties and Tractability Results for Linear Synteny -- Shift Error Detection in Standardized Exams -- An Upper Bound for Number of Contacts in the HP-Model on the Face-Centered-Cubic Lattice (FCC) -- The Combinatorial Partitioning Method -- Compact Suffix Array -- Linear Bidirectional On-Line Construction of Affix Trees -- Using Suffix Trees for Gapped Motif Discovery -- Indexing Text with Approximate q-Grams -- Simple Optimal String Matching Algorithm -- Exact and Efficient Computation of the Expected Number of Missing and Common Words in Random Texts -- Periods and Quasiperiods Characterization -- Finding Maximal Quasiperiodicities in Strings -- On the Complexity of Determining the Period of a String. 330 $aThis book constitutes the refereed proceedings of the 11th Annual Symposium on Combinatorial Pattern Matching, CPM 2000, held in Montreal, Canada, in June 2000.The 29 revised full papers presented together with 3 invited contributions and 2 tutorial lectures were carefully reviewed and selected from 44 submissions. The papers are devoted to current theoretical and algorithmic issues of searching and matching strings and more complicated patterns such as trees, regular expression graphs, point sets and arrays as well as to advanced applications of CPM in areas such as Internet, computational biology, multimedia systems, information retrieval, data compression, and pattern recognition. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v1848 606 $aPattern perception 606 $aComputers 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCombinatorial analysis 606 $aPattern Recognition$3https://scigraph.springernature.com/ontologies/product-market-codes/I2203X 606 $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005 606 $aAlgorithm Analysis and Problem Complexity$3https://scigraph.springernature.com/ontologies/product-market-codes/I16021 606 $aNatural Language Processing (NLP)$3https://scigraph.springernature.com/ontologies/product-market-codes/I21040 606 $aInformation Storage and Retrieval$3https://scigraph.springernature.com/ontologies/product-market-codes/I18032 606 $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010 615 0$aPattern perception. 615 0$aComputers. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science) 615 0$aInformation storage and retrieval. 615 0$aCombinatorial analysis. 615 14$aPattern Recognition. 615 24$aTheory of Computation. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aCombinatorics. 676 $a006.4 702 $aGiancarlo$b Raffaele$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aSankoff$b David$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910143628703321 996 $aCombinatorial Pattern Matching$9772744 997 $aUNINA