Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Review

Average Reviews:

(More customer reviews)Are you looking to buy Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology? Here is the right place to find the great deals. we can offer discounts of up to 90% on Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology. Check out the link below:

>> Click Here to See Compare Prices and Get the Best Offers

Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology ReviewThis textbook gives a rigorous introduction to the algorithms of computational biology from the standpoint of theoretical computer science. It does however give the reader an overview of the practical application of these algorithms to the subject. The author gives a very detailed discussion of the most important results in the field, but the book is very dense: there are 228 definitions, 127 theorems, 490 references, and over 400 exercises that both illustrate the topics in the book and extend them. The author omits any real source code, but does give a URL where code for many of the algorithms can be found.
The author restricts his attention to deterministic approaches to string matching and comparison, and thus there is no treatment of hidden Markov models or Monte Carlo methods. The major algorithms such as the Aho-Corasick, Boyer-Moore, Knuth-Morris-Pratt, Needleman-Winsch, and Smith-Waterman are discussed and brilliantly motivated in the book. The author employs very effective diagrams to illustrate the matching concepts that are detailed in the book.
The book does require some time to read but it is worth the effort. Also, the exercises can be challenging but some should he done in order to understand the concepts in the book. The empirical results of the algorithms as sequence databases are also included, with FASTA, BLAST, BLOCKS, BLOSUM, and PROSITE are discussed in detail. The chapter that discusses these is the least mathematical of all the ones in the book and was no doubt included to connect the reader with real-world applications of the techniques in the book.
The last quarter of the book is a lot more trendy than the rest, with emphasis placed on algorithms for physical mapping, fragment assembly, and phylogenetic trees. These algorithms of course take on particular importance today given the Human Genome and other gene sequencing projects. Radiation-hybrid mappings, direct sequencing, and shotgun DNA sequencing are discussed in one of the chapters in this section, and the author addresses in great detail some approaches to speeding up sequence assembly. In the discussion on shotgun DNA sequencing the author refrains from any probabilistic analysis, instead referring the reader to the references. This omission goes along with the rest of the book, where probabilistic methods are not used, which is a little disappointing since these have shown great promise in computational biology. The exercises at the end of the chpater are very interesting and it is worth spending time working some of them through.
In a later chapter, the solution of the satisfiability problem in mathematical logic is discussed and shown to be solved (at least theoretically) by DNA-based computing. The quantities of DNA needed to carry out the computation are shown to be infeasible by the author.
This book will no doubt be of great assistance to those interested in the more rigorous approaches to computational biology. But the best attribute of the book is that one gets the impression that the author had a good time writing it, and that shows through in this very important book.Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology Overview

Want to learn more information about Algorithms on Strings, Trees and Sequences: Computer Science and Computational Biology?

>> Click Here to See All Customer Reviews & Ratings Now