Order Total (1 Item Items):
Shipping Destination:
Efficient Parallel Serial Approximate by Landau Gad (14 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (14)
- 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 (14)
- 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 (No further results match this refinement)
Binding
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 (4)
- Not Print on Demand (6)
Language (1)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Efficient Parallel and Serial Approximate String Matching Classic Reprint
Seller: PBShop.store UK, Fairford, GLOS, United Kingdom
Seller rating 4 out of 5 stars
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
Condition: New.
-
Paperback. Condition: New. Print on Demand. This book presents two algorithms for the string matching problem with mismatches, where differences between characters are allowed. The first is a parallel algorithm that has three main parts: pattern analysis, text analysis, and finding occurrences of the pattern in the text. The second is a serial algorithm that uses a new approach to text handling. Prior to this book, no algorithm was able to cope with mismatches in the string matching problem. The new serial algorithm is considerably easier to implement, running in O(kn) time for fixed-size alphabets and O(knlogm) for general input, where k is the number of mismatches and n, m are the lengths of input text and pattern respectively. The parallel algorithm takes O(logm) time using m^2 processors for the first two parts, and O(k) time using n processors for the third part. Both algorithms have a space requirement of O(n). The book's insights offer a significant leap from previous algorithms that were not able to handle mismatches, opening new possibilities for practical applications like analyzing unreliable data in real-time scenarios. This book is a reproduction of an important historical work, digitally reconstructed using state-of-the-art technology to preserve the original format. In rare cases, an imperfection in the original, such as a blemish or missing page, may be replicated in the book. print-on-demand item.
-
Condition: New.
-
Gebunden. Condition: New. KlappentextThis work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original w.
-
Efficient Parallel and Serial Approximate String Matching
Language: English
Published by Creative Media Partners, LLC Aug 2015, 2015
ISBN 10: 1340072114 ISBN 13: 9781340072117
Buch. Condition: Neu. Neuware - This work has been selected by scholars as being culturally important, and is part of the knowledge base of civilization as we know it. This work was reproduced from the original artifact, and remains as true to the original work as possible. Therefore, you will see the original copyright references, library stamps (as most of these works have been housed in our most important libraries around the world), and other notations in the work.This work is in the public domain in the United States of America, and possibly other nations. Within the United States, you may freely copy and distribute this work, as no entity (individual or corporate) has a copyright on the body of the work.As a reproduction of a historical artifact, this work may contain missing or blurred pages, poor pictures, errant marks, etc. Scholars believe, and we concur, that this work is important enough to be preserved, reproduced, and made generally available to the public. We appreciate your support of the preservation process, and thank you for being an important part of keeping this knowledge alive and relevant.
-
Condition: New. Print on Demand pp. 26.
-
Condition: New. Print on Demand pp. 26.
-
Condition: New. Print on Demand pp. 26.
-
Condition: New. PRINT ON DEMAND pp. 26.
-
Condition: New. Print on Demand pp. 26.
-
Condition: New. PRINT ON DEMAND pp. 26.
-
Efficient Parallel and Serial Approximate String Matching
Seller: THE SAINT BOOKSTORE, Southport, United Kingdom
Seller rating 5 out of 5 stars
£ 44.41
£ 12.93 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketHardback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days.
