LEADER 03113oam  2200577   450 
001 996465736703316
005 20210717095633.0
010   $a3-540-48452-3
024 7 $a10.1007/3-540-48452-3
035   $a(CKB)1000000000211098
035   $a(SSID)ssj0000321915
035   $a(PQKBManifestationID)11937840
035   $a(PQKBTitleCode)TC0000321915
035   $a(PQKBWorkID)10280252
035   $a(PQKB)10348410
035   $a(DE-He213)978-3-540-48452-3
035   $a(MiAaPQ)EBC3072641
035   $a(MiAaPQ)EBC6485745
035   $a(PPN)155226282
035   $a(EXLCZ)991000000000211098
100   $a20210717d1999      uy             0
101 0 $aeng
135   $aurnn#008mamaa
181   $ctxt
182   $cc
183   $acr
200 00$aCombinatorial pattern matching $e10th annual symposium, CPM 99, Warwick University, UK, July 22-24, 1999 : proceedings /$fMaxime Crochemore, Mike Paterson, editors
205   $a1st ed. 1999.
210  1$aBerlin :$cSpringer,$d[1999]
210  4$d©1999
215   $a1 online resource (VIII, 304 p.)
225 1 $aLecture notes in computer science ;$v1645
300   $aBibliographic Level Mode of Issuance: Monograph
311   $a3-540-66278-2 
320   $aIncludes bibliographical references and index.
327   $aShift-And Approach to Pattern Matching in LZW Compressed Text -- A General Practical Approach to Pattern Matching over Ziv-Lempel Compressed Text -- Pattern Matching in Text Compressed by Using Antidictionaries -- On the Structure of Syntenic Distance -- Physical Mapping with Repeated Probes: The Hypergraph Superstring Problem -- Hybridization and Genome Rearrangement -- On the Complexity of Positional Sequencing by Hybridization -- GESTALT: Genomic Steiner Alignments -- Bounds on the Number of String Subsequences -- Approximate Periods of Strings -- Finding Maximal Pairs with Bounded Gap -- A Dynamic Data Structure for Reverse Lexicographically Sorted Prefixes -- A New Indexing Method for Approximate String Matching -- The Compression of Subsegments of Images Described by Finite Automata -- Ziv Lempel Compression of Huge Natural Language Data Tries Using Suffix Arrays -- Matching of Spots in 2D Electrophoresis Images. Point Matching Under Non-uniform Distortions -- Applying an Edit Distance to the Matching of Tree Ring Sequences in Dendrochronology -- Fast Multi-dimensional Approximate Pattern Matching -- Finding Common RNA Secondary Structures from RNA Sequences -- Finding Common Subsequences with Arcs and Pseudoknots -- Computing Similarity between RNA Structures.
410  0$aLecture notes in computer science ;$v1645.
606   $aComputer algorithms$vCongresses
606   $aCombinatorial analysis$vCongresses
615  0$aComputer algorithms
615  0$aCombinatorial analysis
676   $a005.1
702   $aCrochemore$b Maxime$f1947-
702   $aPaterson$b Michael S.
801  0$bMiAaPQ
801  1$bMiAaPQ
801  2$bUtOrBLW
906   $aBOOK
912   $a996465736703316
996   $aCombinatorial Pattern Matching$9772744
997   $aUNISA