|
Books > Computing & IT > General theory of computing > Data structures
|
Not currently available
125 Problems in Text Algorithms - with Solutions (Paperback)
Loot Price: R1,228
Discovery Miles 12 280
|
|
|
125 Problems in Text Algorithms - with Solutions (Paperback)
Supplier out of stock. If you add this item to your wish list we will let you know when it becomes available.
|
String matching is one of the oldest algorithmic techniques, yet
still one of the most pervasive in computer science. The past 20
years have seen technological leaps in applications as diverse as
information retrieval and compression. This copiously illustrated
collection of puzzles and exercises in key areas of text algorithms
and combinatorics on words offers graduate students and researchers
a pleasant and direct way to learn and practice with advanced
concepts. The problems are drawn from a large range of scientific
publications, both classic and new. Building up from the basics,
the book goes on to showcase problems in combinatorics on words
(including Fibonacci or Thue-Morse words), pattern matching
(including Knuth-Morris-Pratt and Boyer-Moore like algorithms),
efficient text data structures (including suffix trees and suffix
arrays), regularities in words (including periods and runs) and
text compression (including Huffman, Lempel-Ziv and Burrows-Wheeler
based methods).
General
Is the information for this product incomplete, wrong or inappropriate?
Let us know about it.
Does this product have an incorrect or missing image?
Send us a new image.
Is this product missing categories?
Add more categories.
Review This Product
No reviews yet - be the first to create one!
|
You might also like..
|
Email address subscribed successfully.
A activation email has been sent to you.
Please click the link in that email to activate your subscription.
Welcome to Loot.co.za!
Sign in / Register |Wishlists & Gift Vouchers |Help | Advanced search
