menu
{ "item_title" : "DPMax", "item_author" : [" Christian Colossus "], "item_description" : "DPMax stands for 'dynamic programming to the max'. It highlights the graphical and textual analyses of 2 of the most common dynamic programming algorithms: The Longest Common Subsequence and The Longest/Shortest Paths Using Weights. It takes a brief look at the subjects of optimization and dynamic programming before delving into the core subjects of the book. It is a must-have for bioinformaticians, computer scientists and molecular biologists.", "item_img_path" : "https://covers2.booksamillion.com/covers/bam/1/99/957/588/1999575881_b.jpg", "price_data" : { "retail_price" : "32.65", "online_price" : "32.65", "our_price" : "32.65", "club_price" : "32.65", "savings_pct" : "0", "savings_amt" : "0.00", "club_savings_pct" : "0", "club_savings_amt" : "0.00", "discount_pct" : "10", "store_price" : "" } }
DPMax|Christian Colossus

DPMax : Dynamic Programming to the Max Third Edition

local_shippingShip to Me
In Stock.
FREE Shipping for Club Members help

Overview

DPMax stands for 'dynamic programming to the max'. It highlights the graphical and textual analyses of 2 of the most common dynamic programming algorithms: The Longest Common Subsequence and The Longest/Shortest Paths Using Weights. It takes a brief look at the subjects of optimization and dynamic programming before delving into the core subjects of the book. It is a must-have for bioinformaticians, computer scientists and molecular biologists.

This item is Non-Returnable

Details

  • ISBN-13: 9781999575885
  • ISBN-10: 1999575881
  • Publisher: Christian Colossus
  • Publish Date: December 2019
  • Dimensions: 9 x 6 x 0.37 inches
  • Shipping Weight: 0.53 pounds
  • Page Count: 158

Related Categories

You May Also Like...

    1

BAM Customer Reviews