
An Introduction to Bioinformatics Algorithms
Neil C. Jones, Pavel A. Pevzner
Résumé
This introductory text offers a clear exposition of the algorithmic principles driving advances in bioinformatics. Accessible to students in both biology and computer science, it strikes a unique balance between rigorous mathematics and practical techniques, emphasizing the ideas underlying algorithms rather than offering a collection of apparently unrelated problems.
The book introduces biological and algorithmic ideas together, linking issues in computer science to biology and thus capturing the interest of students in both subjects. It demonstrates that relatively few design techniques can be used to solve a large number of practical problems in biology, and presents this material intuitively.
An Introduction to Bioinformatics Algorithms is one of the first books on bioinformatics that can be used by students at an undergraduate level. It includes a dual table of contents, organized by algorithmic idea and biological idea; discussions of biologically relevant problems, including a detailed problem formulation and one or more solutions for each; and brief biographical sketches of leading figures in the field. These interesting vignettes offer students a glimpse of the inspirations and motivations for real work in bioinformatics, making the concepts presented in the text more concrete and the techniques more approachable.
PowerPoint presentations, practical bioinformatics problems, sample code, diagrams, demonstrations, and other materials can be found at http://www.bioalgorithms.info/.
L'auteur - Neil C. Jones
L'auteur - Pavel A. Pevzner
Pavel A. Pevzner est professeur au Département de Mathématiques, d'Informatique et de Biologie à l'Université de Californie du Sud. À la croisée des mathématiques, de l'informatique et de la biologie, cet ouvrage montre la fécondité d'une approche interdisciplinaire.
Sommaire
- Introduction
- Algorithms and Complexity
- Molecular Biology Primer
- Exhaustive Search
- Greedy Algorithms
- Dynamic Programming Algorithms
- Divide-and-Conquer Algorithms
- Graph Algorithms
- Combinatorial Pattern Matching
- Clustering and Trees
- Hidden Markov Models
- Randomized Algorithms
Caractéristiques techniques
PAPIER | |
Éditeur(s) | The MIT Press |
Auteur(s) | Neil C. Jones, Pavel A. Pevzner |
Parution | 04/11/2004 |
Nb. de pages | 435 |
Format | 18 x 23,5 |
Couverture | Relié |
Poids | 880g |
Intérieur | Noir et Blanc |
EAN13 | 9780262101066 |
ISBN13 | 978-0-262-10106-6 |
Avantages Eyrolles.com
Consultez aussi
- Les meilleures ventes en Graphisme & Photo
- Les meilleures ventes en Informatique
- Les meilleures ventes en Construction
- Les meilleures ventes en Entreprise & Droit
- Les meilleures ventes en Sciences
- Les meilleures ventes en Littérature
- Les meilleures ventes en Arts & Loisirs
- Les meilleures ventes en Vie pratique
- Les meilleures ventes en Voyage et Tourisme
- Les meilleures ventes en BD et Jeunesse