Order Total (1 Item Items):
Shipping Destination:
Landau Gad (54 results)
Skip to main search results
Search filters
Product Type
- All Product Types
- Books (54)
- 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 (49)
- As New, Fine or Near Fine (5)
- 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 (26)
- Not Print on Demand (35)
Language (2)
Free Shipping
Seller Location
Seller Rating
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
PAP. Condition: New. New Book. Shipped from UK. Established seller since 2000.
-
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.
-
An Efficient String Matching Algorithm With K Differences for Nucleotide and Amino Acid Sequences 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.
-
Efficient String Matching With K Differences 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.
-
Condition: New.
-
Condition: As New. Unread book in perfect condition.
-
Condition: Brand New. New. US edition. Expediting shipping for all USA and Europe orders excluding PO Box. Excellent Customer Service.
-
Condition: New. This is a Brand-new US Edition. This Item may be shipped from US or any other country as we have multiple locations worldwide.
-
Condition: New. Brand New Original US Edition. Customer service! Satisfaction Guaranteed.
-
Efficient Parallel And Serial Approximat
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: New.
-
Efficient Parallel And Serial Approximat
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
Condition: As New. Unread book in perfect condition.
-
International EditionCondition: New. Brand New! Fast Delivery This is an International Edition and ship within 24-48 hours. Deliver by FedEx and Dhl, & Aramex, UPS, & USPS and we do accept APO and PO BOX Addresses. Order can be delivered worldwide within 7-12 days and we do have flat rate for up to 2LB. Extra shipping charges will be requested if the Book weight is more than 5 LB. This Item May be shipped from India, United states & United Kingdom. Depending on your location and availability.
-
Paperback. Condition: New. Print on Demand. This book examines the String Matching with k Differences problem in computer science. String matching, or pattern matching, is an essential and fundamental problem in computer science. This book investigates a particular type of string matching problem: finding all occurrences of a pattern in a text with at most k differences. In this problem, the differences between characters of the pattern and text can be mismatches, superfluous characters in the text, or superfluous characters in the pattern. The author presents an efficient algorithm for solving the k differences problem, running in 0(m2En) time for a fixed alphabet size and 0(mEn) time for general input. The algorithm has two implementations, the first prioritizing time complexity and the second prioritizing space complexity. The book also discusses the broader context of string matching, including the history of the problem, existing algorithms, and applications in fields such as molecular biology. By providing a comprehensive analysis of the k differences problem, this book serves as a valuable resource for researchers, practitioners, and students in computer science and related fields. 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.
-
Paperback. Condition: New. Print on Demand. This book is an account of the string matching algorithm designed by Gad M. Landau and Uzi Vishkin, and Ruth Nussinov. Adding to existing algorithms that allow mismatches, the newly designed algorithm uniquely allows mismatches, deletions, and insertions. This algorithm operates in significantly reduced time compared to existing algorithms, making this book important reading for those in the field of computer science. This book provides historical context, an outline of the algorithm's development, and insight into its usefulness. 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.
-
Paperback. Condition: New. Print on Demand. This book explores the innovative multimedia network, a system that combines point-to-point message passing and multiaccess channels. The author presents new algorithms designed specifically for this network, demonstrating their efficient partitioning, global sensitive function computation, and minimum spanning tree construction capabilities. These groundbreaking techniques offer a balanced approach, leveraging both the parallelism of the point-to-point network and the broadcast functionality of the multiaccess channel. The book also examines the power of the multimedia network in comparison to its separate components, establishing its superiority for certain computations. Overall, this book significantly advances our understanding of network models and provides valuable insights for researchers and practitioners seeking to harness the potential of multimedia networks. 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.
-
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. KlappentextrnrnExcerpt from An Efficient String Matching Algorithm With K Differences for Nucleotide and Amino Acid SequencesA simple approach to finding good alignments was devised by Tinoco et al (3) and by Maizel and Lenk It construct.
-
Condition: New.
-
Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings (Lecture Notes in Computer Science, 5029)
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.43
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
Combinatorial Pattern Matching
Seller: Ria Christie Collections, Uxbridge, United Kingdom
Seller rating 5 out of 5 stars
£ 50.43
£ 11.98 shipping
Ships from United Kingdom to U.S.A.Quantity: Over 20 available
Add to basketCondition: New. In.
-
-
-
-
Combinatorial Pattern Matching : Proceedings of the 12th Annual Symposium, Cpm 2001 Jerusalem, Israel, July 1-4, 2001
Seller: GreatBookPricesUK, Woodford Green, United Kingdom
Seller rating 5 out of 5 stars
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.
-
Condition: New. pp. 284.
-
Combinatorial Pattern Matching: 19th Annual Symposium, CPM 2008 Pisa, Italy, June 18-20, 2008, Proceedings
Language: English
Published by Springer-Verlag New York Inc, 2008
ISBN 10: 3540690662 ISBN 13: 9783540690665
Paperback. Condition: Brand New. 1st edition. 317 pages. 9.50x6.50x0.75 inches. In Stock.
