Genomic Perl
From Bioinformatics Basics to Working Code
1st Edition
Published on 2. December 2004
978-0-511-05706-9 (ISBN)
Description
This introduction to computational molecular biology will help programmers and biologists learn the skills needed to start work in this important, expanding field. The author explains many of the basic computational problems and gives concise, working programs to solve them in the Perl programming language. With minimal prerequisites, the author explains the biological background for each problem, develops a model for the solution, then introduces the Perl concepts needed to implement the solution. The book covers pairwise and multiple sequence alignment, fast database searches for homologous sequences, protein motif identification, genome rearrangement, physical mapping, phylogeny reconstruction, satellite identification, sequence assembly, gene finding, and RNA secondary structure. The concrete examples and step-by-step approach make it easy to grasp the computational and statistical methods, including dynamic programming, branch-and-bound optimization, greedy methods, maximum likelihood methods, substitution matrices, BLAST searching, and Karlin-Altschul statistics. Perl code is provided on the accompanying CD.
Reviews / Votes
'I came away from this book not just with more knowledge about genetics and biology - indeed, siome of what I learnt has been directly applicable to some work I have - but also with an understanding of some of the complexity of the problems geneticists face. It fully satisfied its goals, expressed in the preface: teaching computer scientists the biological underpinnings of bhioinformatics ... for the programmer like me, interested in what biologists do and how we can helpo them do it, it's by far the clearest introduction available, and I would heartily recommend it.' Simon Cozens 'Genomic Perl gives a balanced and hands-on introduction to a set of algorithms and ideas central to the current practice of bioinformatics. its clear writing and no-frills approach to each topic should appeal to students as well as to university teachers, while providing computational biologists with a concise handbook of the 'greatest hits' in their field.' Naturwissenschaften '... I found this to be an excellent book, and would not hesitate to recommend it to advanced undergraduate and postgraduate students.' Computing Reviews 'I found the descriptions and discussions to be very good, and one can easily follow along and, in fact, easily adapt the algorithms to other programming languages. this is a nice book for those who want to learn about writing programs for solving bionformatic problems, or for those teaching courses on this (or related) subjects.' Journal of the American Statistical AssociationMore details
Language
English
Place of publication
Cambridge
United Kingdom
Publishing group
Cambridge University Press
Target group
College/higher education
Professional and scholarly
Illustrations
Worked examples or Exercises; 100 Tables, color
File size
1,80 MB
ISBN-13
978-0-511-05706-9 (9780511057069)
Copyright in bibliographic data and cover images is held by Nielsen Book Services Limited or by the publishers or by their respective licensors: all rights reserved.
Schweitzer Classification
Other editions
Additional editions
Book
12/2002
Cambridge University Press
€66.85
Article exhausted; check different version
Person
Content
1. The central dogma; 2. RNA secondary structure; 3. Comparing DNA sequences; 4. Statistical models; 5. Substitution matrices for amino acids; 6. Sequence databases; 7. Local alignment and the BLAST heuristic; 8. Statistics of BLAST database searches; 9. Multiple sequence alignment I; 10. Multiple sequence alignment II; 11. Phylogeny reconstruction; 12. Protein motifs and PROSITE; 13. Fragment assembly; 14. Coding sequence prediction with dicodon frequencies; 15. Satellite identification; 16. Restriction mapping; 17. Hybridization mapping; 18. Genome rearrangement: gates and hurdles; 19. Now what?; Appendix A: drawing RNA cloverleaves; Appendix B: space-saving strategies for alignment; Appendix C. a data structure for disjoint sets; Appendix D. a data structure for set operations.
