Algorithms on Strings, Trees and Sequences Computer Science and Computational Biology
List price: $99.99
Buy it from $26.90
This item qualifies for FREE shipping
*A minimum purchase of $35 is required. Shipping is provided via FedEx SmartPost® and FedEx Express Saver®. Average delivery time is 1 – 5 business days, but is not guaranteed in that timeframe. Also allow 1 - 2 days for processing. Free shipping is eligible only in the continental United States and excludes Hawaii, Alaska and Puerto Rico. FedEx service marks used by permission."Marketplace" orders are not eligible for free or discounted shipping.
30 day, 100% satisfaction guarantee
If an item you ordered from TextbookRush does not meet your expectations due to an error on our part, simply fill out a return request and then return it by mail within 30 days of ordering it for a full refund of item cost.
Learn more about our returns policy
Description: String algorithms are a traditional area of study in computer science and, in recent years, their importance has grown dramatically. Gusfield also discusses biological problems that can be cast as string problems, and methods of solving them.
Rush Rewards U
You have reached 400 XP and carrot coins. That is the daily max!
Limited time offer:
Get the first one free!
All the information you need in one place! Each Study Brief is a summary of one specific subject; facts, figures, and explanations to help you learn faster.
List price: $99.99
Copyright year: 1997
Publisher: Cambridge University Press
Publication date: 5/28/1997
Size: 7.25" wide x 10.75" long x 1.50" tall
|Exact String Matching: The Fundamental String Problem|
|Exact matching: fundamental preprocessing and first algorithms|
|Exact matching: classical comparison-based methods|
|Exact matching: a deeper look at classical methods|
|Semi-numerical string matching|
|Suffix Trees And Their Uses|
|Introduction to suffix trees|
|Linear time construction of suffix trees|
|First applications of suffix trees|
|Constant time lowest common ancestor retrieval|
|More applications of suffix trees|
|Inexact Matching, Sequence Alignment, And Dynamic Programming|
|The importance of (sub)sequence comparison in molecular biology|
|Core string edits, alignments, and dynamic programming|
|Refining core string edits and alignments|
|Extending the core problems|
|Multiple string comparison: the Holy Grail|
|Sequence database and their uses: the motherlode|
|Currents, Cousins And Cameos|
|Maps, mapping, sequencing and superstrings|
|Strings and evolutionary trees|
|Three short topics|
|Models of genome-level mutations|