LEADER 06358nam 22007935 450 001 9910143900603321 005 20200704011543.0 010 $a3-540-45452-7 024 7 $a10.1007/3-540-45452-7 035 $a(CKB)1000000000211776 035 $a(SSID)ssj0000321917 035 $a(PQKBManifestationID)11262365 035 $a(PQKBTitleCode)TC0000321917 035 $a(PQKBWorkID)10280680 035 $a(PQKB)11751103 035 $a(DE-He213)978-3-540-45452-6 035 $a(MiAaPQ)EBC3071972 035 $a(PPN)155213547 035 $a(EXLCZ)991000000000211776 100 $a20121227d2002 u| 0 101 0 $aeng 135 $aurnn#008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching $e13th Annual Symposium, CPM 2002 Fukuoka, Japan, July 3-5, 2002 Proceedings /$fedited by Alberto Apostolico, Masayuki Takeda 205 $a1st ed. 2002. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d2002. 215 $a1 online resource (VIII, 290 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v2373 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-43862-9 320 $aIncludes bibliographical references and index. 327 $aPractical Software for Aligning ESTs to Human Genome -- Efficient Text Mining with Optimized Pattern Discovery -- Application of Lempel-Ziv Factorization to the Approximation of Grammar-Based Compression -- Block Merging for Off-Line Compression -- String Matching with Stopper Encoding and Code Splitting -- Pattern Matching Problems over 2-Interval Sets -- The Problem of Context Sensitive String Matching -- Two-Pattern Strings -- Edit Distance with Move Operations -- Towards Optimally Solving the Longest Common SubsequenceProblem for Sequences with Nested Arc Annotations in Linear Time -- Local Similarity Based Point-Pattern Matching -- Identifying Occurrences of Maximal Pairs in Multiple Strings -- Space-Economical Algorithms for Finding Maximal Unique Matches -- The Minimum DAWG for All Suffixes of a String and Its Applications -- On the Complexity of Deriving Position Specific Score Matrices from Examples -- Three Heuristics for ?-Matching: ?-BM Algorithms -- A Better Method for Length Distribution Modeling in HMMs and Its Application to Gene Finding -- Faster Bit-Parallel Approximate String Matching -- One-Gapped q-Gram Filters for Levenshtein Distance -- Optimal Exact and Fast Approximate Two Dimensional Pattern Matching Allowing Rotations -- Statistical Identification of Uniformly Mutated Segments within Repeats -- Simple and Practical Sequence Nearest Neighbors with Block Operations -- Constructing NFAs by Optimal Use of Positions in Regular Expressions. 330 $aThe papers contained in this volume were presented at the 13th Annual S- posium on Combinatorial Pattern Matching, held July 3?5, 2002 at the Hotel Uminonakamichi, in Fukuoka, Japan. They were selected from 37 abstracts s- mitted in response to the call for papers. In addition, there were invited lectures by Shinichi Morishita (University of Tokyo) and Hiroki Arimura (Kyushu U- versity). Combinatorial Pattern Matching (CPM) addresses issues of searching and matching strings and more complicated patterns such as trees, regular expr- sions, graphs, point sets, and arrays, in various formats. The goal is to derive n- trivial combinatorial properties of such structures and to exploit these properties in order to achieve superior performance for the corresponding computational problems. On the other hand, an important goal is to analyze and pinpoint the properties and conditions under which searches cannot be performed e?ciently. Over the past decade a steady ?ow of high-quality research on this subject has changed a sparse set of isolated results into a full-?edged area of algorithmics. This area is continuing to grow even further due to the increasing demand for speed and e?ciency that stems from important applications such as the World Wide Web, computational biology, computer vision, and multimedia systems. These involve requirements for information retrieval in heterogeneous databases, data compression, and pattern recognition. The objective of the annual CPM gathering is to provide an international forum for research in combinatorial p- tern matching and related applications. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v2373 606 $aDiscrete mathematics 606 $aPattern recognition 606 $aAlgorithms 606 $aNatural language processing (Computer science) 606 $aInformation storage and retrieval 606 $aCoding theory 606 $aInformation theory 606 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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 $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 $aCoding and Information Theory$3https://scigraph.springernature.com/ontologies/product-market-codes/I15041 615 0$aDiscrete mathematics. 615 0$aPattern recognition. 615 0$aAlgorithms. 615 0$aNatural language processing (Computer science). 615 0$aInformation storage and retrieval. 615 0$aCoding theory. 615 0$aInformation theory. 615 14$aDiscrete Mathematics. 615 24$aPattern Recognition. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aNatural Language Processing (NLP). 615 24$aInformation Storage and Retrieval. 615 24$aCoding and Information Theory. 676 $a511.1 702 $aApostolico$b Alberto$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aTakeda$b Masayuki$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a9910143900603321 996 $aCombinatorial Pattern Matching$9772744 997 $aUNINA