Contact
How to shop
Delivery
Shopping guide
String Searching Algorithms
English
113 b
30-day return policy
Customers also purchased
String searching is a subject of both theoretical and practical interest in computer science. This is a bibliographic overview of the field and an anthology of descriptions of the principal algorithms available. The aim is two-fold: on the one hand, to provide an easy-to-read comparison of the available techniques in each area; and on the other, to furnish the reader with a reference to in-depth descriptions of the major algorithms. Topics covered include methods for finding exact and approximate string matches, calculating "edit" distances between strings, finding common sequences and finding the longest repetitions within strings. For clarity, all the algorithms are presented in a uniform format and notation.
About the book
English
Give this book today
It's easy
1 Add to cart and choose Deliver as present at the checkout 2 We'll send you a voucher 3 The book will arrive at the recipient's addressYou might also be interested in
/
Hardback
30.51
€
