|
|
Sold Out
Book Categories |
| A Faster Algorithm for Approximate String Matching | 1 | |
| Boyer-Moore Strategy to Efficient Approximate String Matching | 24 | |
| Randomized Efficient Algorithms for Compressed Strings: The Finger-Print Approach | 39 | |
| Filtration with q-Samples in Approximate String Matching | 50 | |
| Computing Discoveries in Molecular Biology | 64 | |
| Approximate Dictionary Queries | 65 | |
| Approximate Multiple String Search | 75 | |
| A 2 2/3 - Approximation Algorithm for the Shortest Superstring Problem | 87 | |
| Suffix Trees on Words | 102 | |
| The Suffix Tree of a Tree and Minimizing Sequential Transducers | 116 | |
| Perfect Hashing for Strings: Formalization and Algorithms | 130 | |
| Spliced Alignment: A New Approach to Gene Recognition | 141 | |
| Original Synteny | 159 | |
| Fast Sorting by Reversal | 168 | |
| A Double Combinatorial Approach to Discovering Patterns in Biological Sequences | 186 | |
| Poisson Process Approximation for Repeats in One Sequence and Its Application to Sequencing by Hybridization | 209 | |
| Improved Approximation Algorithms for Tree Alignment | 220 | |
| The Asymmetric Median Tree - A New Model for Building Consensus Trees | 234 | |
| Constructing Computer Virus Phylogenies | 253 | |
| Docking of Conformationally Flexible Proteins | 271 | |
| Invariant Patterns in Crystal Lattices: Implications for Protein Folding Algorithms | 288 | |
| Graph Traversals, Genes, and Matroids: An Efficient Case of the Travelling Salesman Problem | 301 | |
| Alphabet Independent and Dictionary Scaled Matching | 320 | |
| Analysis of Two-Dimensional Approximate Pattern Matching Algorithms | 335 | |
| Approximation Algorithms for Maximum Two-Dimensional Pattern Matching | 348 | |
| Efficient Parallel Algorithms for Tree Editing Problems | 361 | |
| Approximate Pattern Matching in Directed Graphs | 373 | |
| Finite-State Computability of Annotations of Strings and Trees | 381 | |
| Author Index | 392 |
| Price | Condition | Delivery | Seller | Action |
| $99.99 | Digital |
| WonderClub |
Richard Necklen
reviewed Combinatorial Pattern Matching on February 01, 2008 Combinatorial Pattern Matching
In comparison to "Introduction to Algorithms" (the other algorithm book I had significant exposure to) this one is faster to read, easier to digest and more tailored towards applications.
I found the "Hitchhiker's Guide to Algorithms" in the back to be extremely useful if you really find yourself tackling an algorithmic problem in practice.
The main part (maybe skipping/skimming down a few chapters) is a very good preparation for algorithm-heavy job interviews (e.g. Google, Facebook etc ...).
Very much recommended.
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 List
X
This item is in your Collection
Combinatorial Pattern Matching
X
This Item is in Your Inventory
Combinatorial Pattern Matching
X
You must be logged in to review the productsX
X
X
Add Combinatorial Pattern Matching, , Combinatorial Pattern Matching to the inventory that you are selling on WonderClubX
X
Add Combinatorial Pattern Matching, , Combinatorial Pattern Matching to your collection on WonderClub |
