44 of 44 people found the following review helpful:
4.0 out of 5 stars
Nice book for experts, November 17, 2000
By A Customer
This review is from: Computational Molecular Biology: An Algorithmic Approach (Computational Molecular Biology) (Hardcover)
The title is somewhat misleading because the book is primarily devoted to combinatorial methods that could be used in genome sequencing and genomics. The selection of methods is arbitrary and does not seem to be dictated by either pedagogical or scientific vision. It mainly reflects the author's own work and interests. Contrary to what the editorial review states I find this text quite abstract and formal. I like the book very much but I don't think it should be recommended to the beginners in computational biology. Readers who have a taste for mathematics and a strong background in combinatorics could benefit the most from reading this book. Anybody who looks for a textbook-level guidance in computational biology should probably rely on better designed texts such as Don Gusfield's "Algorithms on strings trees and sequences" or "Biological sequence analysis" by Durbin and co-authors. However, the readers who are interested in mathematics behind designs of DNA arrays (chapter 5) or in mathematical treatment of genome rearrangements (chapter 10) should certainly read this book in detail.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
14 of 14 people found the following review helpful:
4.0 out of 5 stars
A must have for computational biologists, October 25, 2000
By A Customer
This review is from: Computational Molecular Biology: An Algorithmic Approach (Computational Molecular Biology) (Hardcover)
If you want to understand what is INSIDE those nice software tools available to molecular biologists and now on the web you have to study this book. It's a little more advanced than Gusfield's in some aspects, and more research oriented. Of course it does not cover uniformly all areas of computational biology: if you know Pavel's work, it would be very easy to predict the content of the chapters. For example, more than 50 pages are dedicated to genome rearrangement, but only 10 on multiple sequence alignment. Anyway, this is good, because we can learn about alignment from many other books, in particular the one by Gusfield. I strongly recommend this book to anyone interested in this fascinating field of Science.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
9 of 9 people found the following review helpful:
4.0 out of 5 stars
Readable and practical, February 4, 2005
This review is from: Computational Molecular Biology: An Algorithmic Approach (Computational Molecular Biology) (Hardcover)
Pevzner has written a very useful book on bioinformatics algorithms, and one that seems reasonably up to date. The table of contents follows a classic plan: restriction maps, assembly and sequencing, 2- and N- way string comparisons, and analysis of rearrangements. There's a good but brief section on mass spec analysis - unfortunately, that chapter is called "Proteomics" even though the term covers a lot more than MS. Other sections skim the surface of hidden Markov models and Gibbs sampling for finding patterns ("motifs") in DNA.
A few chapters have unusual strengths. The "Conway Equation" gives more insight in analysis of motif significance than other introductory books do. The section in sequence comparison pays a lot more attention to BLAST-like algorithms than other books do, also - modern material you'd normally see only in the journals. Also, the section on rearrangements gives some ideas about using rearrangement data for phylogenetic analysis. That really gives the material meaning. Rearrangements aren't just string operations, they're features of evolution, and they can be compared to each other. No matter what the discussion, Pevzner keeps maintains a readable and enjoyably informal tone.
The book does have some weaknesses, though. It's a bit advanced for an undergrad intro, but bottoms out before the Baum-Welch algorithm, for example. Discussion of microarrays for sequencing seems dated. Pevnzer describes their use in sequencing, a rarity now, but skips their use in functional gneomics, where they are used most often. Illustration style is erratic and many diagrams are oddly stretched (3.5, 5.7, 8.3, and others, some much worse). Formal analysis of the algorithms is weak, but Pevzner somewhat makes up for that with better statistical analysis than many authors give. Also, even though the book was reprinted in 2001, it still estimates 100K genes in the human genome.
This is a good second book, maybe the one to read after Pevzner's newer "Introduction". It covers most of the basics and gives fairly usable pseudocode. Most of all, it always keeps the biology in mind. That, by itself, makes this book stand out.
//wiredweird
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No