Combinatorial Pattern Matching
12th Annual Symposium, CPM 2001 Jerusalem, Israel, July 1-4, 2001 Proceedings
Series: Lecture Notes in Computer Science; 2089;
- Publisher's listprice EUR 53.49
-
22 690 Ft (21 609 Ft + 5% VAT)
The price is estimated because at the time of ordering we do not know what conversion rates will apply to HUF / product currency when the book arrives. In case HUF is weaker, the price increases slightly, in case HUF is stronger, the price goes lower slightly.
- Discount 8% (cc. 1 815 Ft off)
- Discounted price 20 874 Ft (19 880 Ft + 5% VAT)
22 690 Ft
Availability
Estimated delivery time: In stock at the publisher, but not at Prospero's office. Delivery time approx. 3-5 weeks.
Not in stock at Prospero.
Why don't you give exact delivery time?
Delivery time is estimated on our previous experiences. We give estimations only, because we order from outside Hungary, and the delivery time mainly depends on how quickly the publisher supplies the book. Faster or slower deliveries both happen, but we do our best to supply as quickly as possible.
Product details:
- Edition number 2001
- Publisher Springer
- Date of Publication 13 June 2001
- Number of Volumes 1 pieces, Book
- ISBN 9783540422716
- Binding Paperback
- No. of pages280 pages
- Size 233x155 mm
- Weight 890 g
- Language English
- Illustrations VIII, 280 p. 0
Categories
Long description:
Springer Book Archives
MoreTable of Contents:
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.
More
