Order Total (1 Item Items):
Shipping Destination:
Pattern Matching Algorithms by Apostolico Alberto Galil Zvi Editors (1 results)
Feedback
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (1)
- Magazines & Periodicals (No further results match this refinement)
- Comics (No further results match this refinement)
- Sheet Music (No further results match this refinement)
- Art, Prints & Posters (No further results match this refinement)
- Photographs (No further results match this refinement)
- Maps (No further results match this refinement)
- Manuscripts & Paper Collectibles (No further results match this refinement)
Condition Learn more
- New (No further results match this refinement)
- As New, Fine or Near Fine (No further results match this refinement)
- Very Good or Good (No further results match this refinement)
- Fair or Poor (No further results match this refinement)
- As Described (1)
Binding
- All Bindings
- Hardcover (No further results match this refinement)
- Softcover (No further results match this refinement)
Collectible Attributes
- First Edition (No further results match this refinement)
- Signed (No further results match this refinement)
- Dust Jacket (No further results match this refinement)
- Seller-Supplied Images (No further results match this refinement)
- Not Print on Demand (1)
Language (1)
Price
- Any Price
- Under US$ 25 (No further results match this refinement)
- US$ 25 to US$ 50 (No further results match this refinement)
- Over US$ 50
Free Shipping
- Free Shipping to U.S.A. (No further results match this refinement)
Seller Location
Seller Rating
-
Pattern Matching Algorithms
Published by Oxford University Press (1997), New York / Oxford, 1997
Seller: Expatriate Bookshop of Denmark, Svendborg, Denmark
Seller rating 5 out of 5 stars
US$ 69.00
Convert currencyUS$ 150.74 shipping from Denmark to U.S.A.Quantity: 1 available
Add to basketorig.cloth. Condition: Minor rubbing. VG. 24x16cm, (12),377 pp Contains 11 papers. Includes: M. Crochemore "Off-Line Serial Exact String Searching"; Z. Galil & I. Yudkiewicz "Off-Line Parallel Exact String Searching"; A. Apostolico "On-Line String Searching"; D. Hirschberg " Serial Computations of Levenshtein Distances"; A. Apostolico & M.J. Atallah "Parallel Computations of Levenshtein Distances"; G.M. Landau & U. Vishkin "Approximate String Searching"; R. Giancarlo "Dynamic Programming: Special Cases"; M. Li & T. Jiang "Shortest Common Superstrings"; A. Amir & M, Farach "Two Dimensional Matching"; R. Giancardo & R. Grossi "Suffix Tree Data Structures for Matrices"; K. Zhang & S. Shasha "Tree Pattern Matching".
