000 03719nam a22006615i 4500
001 978-3-540-48452-3
003 DE-He213
005 20240423132442.0
007 cr nn 008mamaa
008 121227s1999 gw | s |||| 0|eng d
020 _a9783540484523
_9978-3-540-48452-3
024 7 _a10.1007/3-540-48452-3
_2doi
050 4 _aQ337.5
050 4 _aTK7882.P3
072 7 _aUYQP
_2bicssc
072 7 _aCOM016000
_2bisacsh
072 7 _aUYQP
_2thema
082 0 4 _a006.4
_223
245 1 0 _aCombinatorial Pattern Matching
_h[electronic resource] :
_b10th Annual Symposium, CPM 99, Warwick University, UK, July 22-24, 1999 Proceedings /
_cedited by Maxime Crochemore, Mike Paterson.
250 _a1st ed. 1999.
264 1 _aBerlin, Heidelberg :
_bSpringer Berlin Heidelberg :
_bImprint: Springer,
_c1999.
300 _aVIII, 304 p.
_bonline resource.
336 _atext
_btxt
_2rdacontent
337 _acomputer
_bc
_2rdamedia
338 _aonline resource
_bcr
_2rdacarrier
347 _atext file
_bPDF
_2rda
490 1 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1645
505 0 _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.
650 0 _aPattern recognition systems.
650 0 _aComputer programming.
650 0 _aData structures (Computer science).
650 0 _aInformation theory.
650 0 _aAlgorithms.
650 0 _aArtificial intelligence
_xData processing.
650 0 _aComputer science
_xMathematics.
650 0 _aDiscrete mathematics.
650 1 4 _aAutomated Pattern Recognition.
650 2 4 _aProgramming Techniques.
650 2 4 _aData Structures and Information Theory.
650 2 4 _aAlgorithms.
650 2 4 _aData Science.
650 2 4 _aDiscrete Mathematics in Computer Science.
700 1 _aCrochemore, Maxime.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
700 1 _aPaterson, Mike.
_eeditor.
_4edt
_4http://id.loc.gov/vocabulary/relators/edt
710 2 _aSpringerLink (Online service)
773 0 _tSpringer Nature eBook
776 0 8 _iPrinted edition:
_z9783540662785
776 0 8 _iPrinted edition:
_z9783662183809
830 0 _aLecture Notes in Computer Science,
_x1611-3349 ;
_v1645
856 4 0 _uhttps://doi.org/10.1007/3-540-48452-3
912 _aZDB-2-SCS
912 _aZDB-2-SXCS
912 _aZDB-2-LNC
912 _aZDB-2-BAE
942 _cSPRINGER
999 _c187899
_d187899