LEADER 04168nam  22006855  450 
001 9910144908203321
005 20200629223512.0
010   $a3-540-69054-9
024 7 $a10.1007/BFb0030776
035   $a(CKB)1000000000234816
035   $a(SSID)ssj0000321922
035   $a(PQKBManifestationID)11255110
035   $a(PQKBTitleCode)TC0000321922
035   $a(PQKBWorkID)10280967
035   $a(PQKB)10980386
035   $a(DE-He213)978-3-540-69054-2
035   $a(PPN)15522204X
035   $a(EXLCZ)991000000000234816
100   $a20121227d1998      u|         0
101 0 $aeng
135   $aurnn|008mamaa
181   $ctxt
182   $cc
183   $acr
200 10$aCombinatorial Pattern Matching$b[electronic resource] $e9th Annual Symposium, CPM'98, Piscataway, New Jersey, USA, July 20-22, 1998, Proceedings /$fedited by Martin Farach-Colton
205   $a1st ed. 1998.
210  1$aBerlin, Heidelberg :$cSpringer Berlin Heidelberg :$cImprint: Springer,$d1998.
215   $a1 online resource (IX, 259 p.) 
225 1 $aLecture Notes in Computer Science,$x0302-9743 ;$v1448
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-64739-2 
327   $aA fast bit-vector algorithm for approximate string matching based on dynamic programming -- A bit-parallel approach to suffix automata: Fast extended string matching -- A dictionary matching algorithm fast on the average for terms of varying length -- A very fast string matching algorithm for small alphabets and long patterns -- Approximate word sequence matching over Sparse Suffix Trees -- Efficient parallel algorithm for the editing distance between ordered trees -- Reporting exact and approximate regular expression matches -- An approximate oracle for distance in metric spaces -- A rotation invariant filter for two-dimensional string matching -- Constructing suffix arrays for multi-dimensional matrices -- Simple and flexible detection of contiguous repeats using a suffix tree Preliminary Version -- Comparison of coding DNA -- Fixed topology alignment with recombination -- Aligning alignments -- Efficient special cases of pattern matching with swaps -- Aligning DNA sequences to minimize the change in protein -- Genome halving.
330   $aThis book constitutes the refereed proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching, CPM 98, held in Piscataway, NJ, USA, in July 1998. The 17 revised full papers presented were carefully reviewed and selected for inclusion in the book. The papers address all current issues in combinatorial pattern matching dealing with a variety of classical objects to be matched as well as with DNA coding.
410  0$aLecture Notes in Computer Science,$x0302-9743 ;$v1448
606   $aPattern perception
606   $aAlgorithms
606   $aComputers
606   $aComputer science?Mathematics
606   $aCombinatorial analysis
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   $aTheory of Computation$3https://scigraph.springernature.com/ontologies/product-market-codes/I16005
606   $aDiscrete Mathematics in Computer Science$3https://scigraph.springernature.com/ontologies/product-market-codes/I17028
606   $aCombinatorics$3https://scigraph.springernature.com/ontologies/product-market-codes/M29010
615  0$aPattern perception.
615  0$aAlgorithms.
615  0$aComputers.
615  0$aComputer science?Mathematics.
615  0$aCombinatorial analysis.
615 14$aPattern Recognition.
615 24$aAlgorithm Analysis and Problem Complexity.
615 24$aTheory of Computation.
615 24$aDiscrete Mathematics in Computer Science.
615 24$aCombinatorics.
676   $a006.4
702   $aFarach-Colton$b Martin$4edt$4http://id.loc.gov/vocabulary/relators/edt
906   $aBOOK
912   $a9910144908203321
996   $aCombinatorial Pattern Matching$9772744
997   $aUNINA