|
|
|
|
LEADER |
04037nam a2200589 4500 |
001 |
978-3-540-48194-2 |
003 |
DE-He213 |
005 |
20191026031923.0 |
007 |
cr nn 008mamaa |
008 |
100301s2001 gw | s |||| 0|eng d |
020 |
|
|
|a 9783540481942
|9 978-3-540-48194-2
|
024 |
7 |
|
|a 10.1007/3-540-48194-X
|2 doi
|
040 |
|
|
|d GrThAP
|
050 |
|
4 |
|a Q337.5
|
050 |
|
4 |
|a TK7882.P3
|
072 |
|
7 |
|a UYQP
|2 bicssc
|
072 |
|
7 |
|a COM016000
|2 bisacsh
|
072 |
|
7 |
|a UYQP
|2 thema
|
082 |
0 |
4 |
|a 006.4
|2 23
|
245 |
1 |
0 |
|a Combinatorial Pattern Matching
|h [electronic resource] :
|b 12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings /
|c edited by Amihood Amir, Gad M. Landau.
|
250 |
|
|
|a 1st ed. 2001.
|
264 |
|
1 |
|a Berlin, Heidelberg :
|b Springer Berlin Heidelberg :
|b Imprint: Springer,
|c 2001.
|
300 |
|
|
|a VIII, 280 p.
|b online resource.
|
336 |
|
|
|a text
|b txt
|2 rdacontent
|
337 |
|
|
|a computer
|b c
|2 rdamedia
|
338 |
|
|
|a online resource
|b cr
|2 rdacarrier
|
347 |
|
|
|a text file
|b PDF
|2 rda
|
490 |
1 |
|
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2089
|
505 |
0 |
|
|a Regular Expression Searching over Ziv-Lempel Compressed Text -- Parallel Lempel Ziv Coding (Extended Abstract) -- Approximate Matching of Run-Length Compressed Strings -- What to Do with All this Hardware? (Invited Lecture) -- Efficient Experimental String Matching by Weak Factor Recognition* -- Better Filtering with Gapped q-Grams -- Fuzzy Hamming Distance: A New Dissimilarity Measure (Extended Abstract) -- An Extension of the Periodicity Lemma to Longer Periods (Invited Lecture) -- A Very Elementary Presentation of the Hannenhalli-Pevzner Theory -- Tandem Cyclic Alignment -- An Output-Sensitive Flexible Pattern Discovery Algorithm -- Episode Matching* -- String Resemblance Systems: A Unifying Framework for String Similarity with Applications to Literature and Music -- Efficient Discovery of Proximity Patterns with Suffix Arrays (Extended Abstract) -- Computing the Equation Automaton of a Regular Expression in O(s 2 ) Space and Time -- On-Line Construction of Compact Directed Acyclic Word Graphs* -- Linear-Time Longest-Common-Prefix Computation in Suffix Arrays and Its Applications -- Multiple Pattern Matching Algorithms on Collage System -- Finding All Common Intervals of k Permutations -- Generalized Pattern Matching and the Complexity of Unavoidability Testing -- Balanced Suffix Trees (Invited Lecture) -- A Fast Algorithm for Optimal Alignment between Similar Ordered Trees -- Minimum Quartet Inconsistency Is Fixed Parameter Tractable -- Optimally Compact Finite Sphere Packings - Hydrophobic Cores in the FCC.
|
650 |
|
0 |
|a Pattern recognition.
|
650 |
|
0 |
|a Algorithms.
|
650 |
|
0 |
|a Information storage and retrieval.
|
650 |
|
0 |
|a Coding theory.
|
650 |
|
0 |
|a Information theory.
|
650 |
|
0 |
|a Combinatorics.
|
650 |
1 |
4 |
|a Pattern Recognition.
|0 http://scigraph.springernature.com/things/product-market-codes/I2203X
|
650 |
2 |
4 |
|a Algorithm Analysis and Problem Complexity.
|0 http://scigraph.springernature.com/things/product-market-codes/I16021
|
650 |
2 |
4 |
|a Information Storage and Retrieval.
|0 http://scigraph.springernature.com/things/product-market-codes/I18032
|
650 |
2 |
4 |
|a Coding and Information Theory.
|0 http://scigraph.springernature.com/things/product-market-codes/I15041
|
650 |
2 |
4 |
|a Combinatorics.
|0 http://scigraph.springernature.com/things/product-market-codes/M29010
|
700 |
1 |
|
|a Amir, Amihood.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
700 |
1 |
|
|a Landau, Gad M.
|e editor.
|4 edt
|4 http://id.loc.gov/vocabulary/relators/edt
|
710 |
2 |
|
|a SpringerLink (Online service)
|
773 |
0 |
|
|t Springer eBooks
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540829430
|
776 |
0 |
8 |
|i Printed edition:
|z 9783540422716
|
830 |
|
0 |
|a Lecture Notes in Computer Science,
|x 0302-9743 ;
|v 2089
|
856 |
4 |
0 |
|u https://doi.org/10.1007/3-540-48194-X
|z Full Text via HEAL-Link
|
912 |
|
|
|a ZDB-2-SCS
|
912 |
|
|
|a ZDB-2-LNC
|
912 |
|
|
|a ZDB-2-BAE
|
950 |
|
|
|a Computer Science (Springer-11645)
|