LEADER 05461nam 22007695 450 001 996466248203316 005 20200630171201.0 010 $a3-540-48450-7 024 7 $a10.1007/3-540-58094-8 035 $a(CKB)1000000000234120 035 $a(SSID)ssj0000321919 035 $a(PQKBManifestationID)11255989 035 $a(PQKBTitleCode)TC0000321919 035 $a(PQKBWorkID)10281102 035 $a(PQKB)10084558 035 $a(DE-He213)978-3-540-48450-9 035 $a(PPN)155222287 035 $a(EXLCZ)991000000000234120 100 $a20121227d1994 u| 0 101 0 $aeng 135 $aurnn|008mamaa 181 $ctxt 182 $cc 183 $acr 200 10$aCombinatorial Pattern Matching$b[electronic resource] $eFifth Annual Symposium, CPM '94, Asilomar, CA, USA, June 5 - 8, 1994. Proceedings /$fedited by Maxime Crochemore, Dan Gusfield 205 $a1st ed. 1994. 210 1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1994. 215 $a1 online resource (IX, 331 p.) 225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v807 300 $aBibliographic Level Mode of Issuance: Monograph 311 $a3-540-58094-8 327 $aA space efficient algorithm for finding the best non-overlapping alignment score -- The parameterized complexity of sequence alignment and consensus -- Computing all suboptimal alignments in linear space -- Approximation algorithms for multiple sequence alignment -- A context dependent method for comparing sequences -- Fast identification of approximately matching substrings -- Alignment of trees ? An alternative to tree edit -- Parametric recomputing in alignment graphs -- A lossy data compression based on string matching: Preliminary analysis and suboptimal algorithms -- A text compression scheme that allows fast searching directly in the compressed file -- An alphabet-independent optimal parallel search for three dimensional pattern -- Unit route upper bound for string-matching on hypercube -- Computation of squares in a string -- Minimization of sequential transducers -- Shortest common superstrings for strings of random letters -- Maximal common subsequences and minimal common supersequences -- Dictionary-matching on unbounded alphabets: Uniform length dictionaries -- Proximity matching using fixed-queries trees -- Query primitives for tree-structured data -- Multiple matching of parameterized patterns -- Approximate string matching with don't care characters -- Matching with matrix norm minimization -- Approximate string matching and local similarity -- Polynomial-time algorithms for computing characteristic strings -- Recent methods for RNA modeling using stochastic context-free grammars -- Efficient bounds for oriented chromosome inversion distance. 330 $aThis volume presents the proceedings of the Fifth Annual Symposium on Combinatorial Pattern Matching, held at Asilomar, California, in June 1994. The 26 selected papers in this volume are organized in chapters on Alignments, Various Matchings, Combinatorial Aspects, and Bio-Informatics. Combinatorial Pattern Matching addresses issues of searching and matching of strings and more complicated patterns, as for example trees. The goal is to derive non-trivial combinatorial properties for such structures and then to exploit these properties in order to achieve superior performance for the corresponding computational problems. In recent years, combinatorial pattern matching has developed into a full-fledged area of algorithmics and is expected to grow even further during the next years. 410 0$aLecture Notes in Computer Science,$x0302-9743 ;$v807 606 $aPattern recognition 606 $aDiscrete mathematics 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 $aDiscrete Mathematics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29000 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$aDiscrete mathematics. 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$aDiscrete Mathematics. 615 24$aAlgorithm Analysis and Problem Complexity. 615 24$aInformation Storage and Retrieval. 615 24$aCoding and Information Theory. 615 24$aCombinatorics. 676 $a006.4 702 $aCrochemore$b Maxime$4edt$4http://id.loc.gov/vocabulary/relators/edt 702 $aGusfield$b Dan$4edt$4http://id.loc.gov/vocabulary/relators/edt 906 $aBOOK 912 $a996466248203316 996 $aCombinatorial Pattern Matching$9772744 997 $aUNISA