Sold Out
Book Categories |
1 | Off-line Serial Exact String Searching | 1 |
2 | Off-line Parallel Exact String Searching | 55 |
3 | On-line String Searching | 89 |
4 | Serial Computations of Levenshtein Distances | 123 |
5 | Parallel Computations of Levenshtein Distances | 143 |
6 | Approximate String Searching | 185 |
7 | Dynamic Programming: Special Cases | 201 |
8 | Shortest Common Superstrings | 237 |
9 | Two Dimensional Matching | 267 |
10 | Suffix Tree Data Structures for Matrices | 293 |
11 | Tree Pattern Matching | 341 |
Login|Complaints|Blog|Games|Digital Media|Souls|Obituary|Contact Us|FAQ
CAN'T FIND WHAT YOU'RE LOOKING FOR? CLICK HERE!!! X
You must be logged in to add to WishlistX
This item is in your Wish ListX
This item is in your CollectionPattern Matching Algorithms
X
This Item is in Your InventoryPattern Matching Algorithms
X
You must be logged in to review the productsX
X
X
Add Pattern Matching Algorithms, Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algor, Pattern Matching Algorithms to the inventory that you are selling on WonderClubX
X
Add Pattern Matching Algorithms, Issues of matching and searching on elementary discrete structures arise pervasively in computer science and many of its applications, and their relevance is expected to grow as information is amassed and shared at an accelerating pace. Several algor, Pattern Matching Algorithms to your collection on WonderClub |