Skip to:Content
|
Bottom
Cover image for Computational and visualization techniques for structural bioinformatics using chimera
Title:
Computational and visualization techniques for structural bioinformatics using chimera
Series:
Chapman & Hall/CRC mathematical and computational biology series
Publication Information:
Boca Raton : CRC Press, Taylor & Francis Group, 2015
Physical Description:
xxv, 419 pages : illustrations (some color) ; 24 cm.
ISBN:
9781439836613
Abstract:
"Goals of this book while attending a workshop or conference on Structural Bioinformatics you may overhear tidbits of conversations that are interspersed with phrases such as "phosphofructokinase regulation", "singular value decomposition", or "class instantiation". The usage of such terminology, arising from biochemistry, mathematics, and computer science respectively would not be surprising in this setting because these three areas of investigation have become the core of expertise required for the study of structural bioinformatics:"--provided by publisher

Available:*

Library
Item Barcode
Call Number
Material Type
Item Category 1
Status
Searching...
30000010344110 QH324.2 B874 2015 Open Access Book Book
Searching...

On Order

Summary

Summary

A Step-by-Step Guide to Describing Biomolecular Structure

Computational and Visualization Techniques for Structural Bioinformatics Using Chimera shows how to perform computations with Python scripts in the Chimera environment. It focuses on the three core areas needed to study structural bioinformatics: biochemistry, mathematics, and computation.

Understand Important Concepts of Structural Bioinformatics

The book covers topics that deal primarily with protein structure and includes many exercises that are grounded in biological problems at the molecular level. The text encourages mathematical analysis by providing a firm foundation for computations. It analyzes numerous Python scripts for the Chimera environment, with the scripts and other material available on a supplementary website.

Build Python Scripts to Extend the Capabilities of Chimera

Through more than 60 exercises that involve the development of Python scripts, the book gives you concrete guidance on using the scripting capabilities of Chimera. You'll gain experience in solving real problems as well as understand the various applications of linear algebra. You can also use the scripts as starting points for the development of similar applications and use classes from the StructBio toolkit for computations, such as structure overlap, data plotting, scenographics, and display of residue networks.

Print Versions of this book also include access to the ebook version.


Author Notes

Forbes Burkowski is a professor of computer science at the University of Waterloo in Ontario, Canada.


Table of Contents

Prefacep. xvii
Acknowledgmentsp. xxiii
Authorp. xxv
Chapter 1 Introduction: Macromolecules and Chimerap. 1
1.1 Motivationp. 1
1.2 Why Chimera?p. 2
1.3 Getting Started With Chimerap. 4
1.4 Overview of Protein Structurep. 4
1.4.1 Amino Acids and Primary Sequencep. 5
1.4.2 Secondary Structurep. 10
1.4.2.1 Alpha Helicesp. 10
1.4.2.2 Beta Strandsp. 12
1.4.2.3 Loopsp. 16
1.4.3 Tertiary Structurep. 17
1.4.3.1 What Is Tertiary Structure?p. 17
1.4.3.2 Tertiary Structure of Myoglobinp. 18
1.4.3.3 Tertiary Structure beyond the Binding Pocketp. 21
1.4.4 Quaternary Structurep. 27
1.4.5 Protein Functionalityp. 29
1.4.6 Protein Domainsp. 31
1.5 Exercisesp. 33
Referencesp. 35
Chapter 2 Accessing and Displaying Molecular Data with Chimerap. 39
2.1 Motivationp. 39
2.2 Python Skillsp. 40
2.3 Python Scriptingp. 41
2.3.1 Script 2.1: Using Raw Input to Get a PDB IDp. 44
2.4 Chimera Object Hierarchyp. 44
2.5 Attributes for Molecule Objectsp. 48
2.6 Attributes for Sequence Objectsp. 49
2.6.1 Referencing a Sequence Objectp. 49
2.6.2 Identification of a Sequencep. 50
2.6.3 Sequence Entriesp. 50
2.6.4 Getting Residue Objects from a Sequencep. 51
2.6.5 Residue Maps for Sequencesp. 52
2.7 Attributes for Residue Objectsp. 53
2.7.1 Referencing a Residue Objectp. 53
2.7.2 Identification and Characterization of Residuesp. 54
2.7.3 Location of a Residuep. 55
2.7.4 Deriving Substructurep. 56
2.7.5 Other Useful Attributesp. 57
2.8 Attributes for Atom Objectsp. 58
2.8.1 Referencing Atom Objectsp. 58
2.8.2 Identification of Atoms and Atom Propertiesp. 59
2.8.3 Working with Atom Coordinatesp. 60
2.8.4 Atom Attributes Related to Chemical Structurep. 60
2.8.5 Atoms and Bondsp. 61
2.5.1 Atom Attributes Related to the Displayp. 62
2.9 Attributes for Bond Objectsp. 62
2.9.1 Referencing Bond Objectsp. 62
2.9.2 Bond Attributesp. 63
2.10 Working with a Batch of Filesp. 64
2.10.1 Dealing with Filesp. 64
2.10.2 Script 2.2: Getting a Batch of Files from the Protein Data Bankp. 66
2.10.3 Script 2.3: Getting a Batch of PDB Files by Using Chimerap. 67
2.11 Hiliter Classp. 67
2.12 Hbonddicts Classp. 69
2.12.1 Using the HBondDicts Classp. 69
2.13 Exercisesp. 71
Referencesp. 86
Websites for Pythonp. 86
Chapter 3 Algorithms Dealing with Distancep. 87
3.1 Motivationp. 87
3.2 Calculating Interatomic Distancesp. 87
3.3 Applicationsp. 90
3.4 Rapid Determination of Atom Membership in Shellsp. 90
3.4.1 Implementation Strategyp. 91
3.5 Contact Maps for Proteinsp. 95
3.5.1 Script for Generating Contact and Distance Mapsp. 97
3.6 Inertial Axesp. 99
3.6.1 Motivationp. 99
3.6.2 Mathematical Analysisp. 100
3.6.3 Script for Computing the Inertial Axisp. 104
3.7 Dehydronsp. 108
3.7.1 Motivationp. 108
3.7.2 Script for Identifying Dehydronsp. 110
3.8 Exercisesp. 112
Referencesp. 132
Chapter 4 Algorithms Dealing with Anglesp. 135
4.1 Motivationp. 135
4.2 Bond Anglep. 135
4.2.1 Calculating Bond Angles in a Scriptp. 136
4.3 Dihedral Anglesp. 137
4.3.1 Denning Dihedral Anglesp. 137
4.3.2 Mathematics for the Computation of a Dihedral Anglep. 139
4.3.3 Computation of a Normalp. 139
4.3.4 Calculating the Phi Dihedral Anglep. 142
4.3.5 Sign of the Dihedral Anglep. 142
4.3.6 Calculating the Psi Dihedral Anglep. 144
4.3.7 Calculating Dihedral Angles in a Scriptp. 144
4.4 Ramachandran Plotsp. 145
4.4.1 Scripts for Generating Ramachandran Plotsp. 149
4.4.2 Script 4.1: Generating a Ramachandran Plot for a Proteinp. 150
4.4.3 Background Densities for Ramachandran Plotsp. 151
4.4.4 3D Ramachandran Plotsp. 152
4.5 Least Squares Planep. 154
4.5.1 Motivationp. 154
4.5.2 Least Squares Plane: Mathematical Analysisp. 154
4.5.3 A Script for Computing the Least Squares Planep. 159
4.6 Exercisesp. 165
Referencesp. 179
Chapter 5 Structure Overlap and Alignmentp. 181
5.1 Motivationp. 181
5.2 Introductionp. 184
5.2.1 Specifying the Problemp. 184
5.3 Techniques for Structural Comparisonp. 185
5.4 Scoring Similarities and Optimizing Scoresp. 186
5.5 Superposition Algorithmsp. 186
5.5.1 Overviewp. 186
5.5.2 Characterizing the Superposition Algorithmp. 188
5.5.3 Formal Problem Descriptionp. 189
5.5.4 Computations to Achieve Maximal Overlapp. 190
5.5.5 Summaryp. 197
5.5.6 Measuring Overlapp. 198
5.5.6.1 Calculation of the Root Mean Square Deviationp. 198
5.6 A Simple Script to Do Structural Superimpositionp. 199
5.7 Protein Sequence Alignmentp. 202
5.7.1 Partial matchesp. 203
5.7.2 Gapsp. 205
5.7.3 Summaryp. 206
5.7.4 Computationp. 206
5.7.4.1 Subproblem Specificationp. 207
5.7.4.2 Scoring Alignmentsp. 207
5.7.4.3 Suitability of the Subproblemp. 208
5.7.4.4 A Global Alignment Examplep. 211
5.8 Variations in the Global Alignment Algorithmp. 212
5.9 Percent Identity Comparisonp. 213
5.10 Local Alignmentp. 214
5.11 A Script to do Sequence Alignment and then Structural Overlapp. 216
5.12 Dealing with Weaker Sequence Similarityp. 218
5.12.1 Structural Alignment by Overlapping Pairs of Secondary Structure Elementsp. 220
5.12.2 A Script for Structural Alignment by Overlapping Secondary Structure Elementsp. 224
5.13 Exercisesp. 226
Referencesp. 242
Chapter 6 Potential Energy Functionsp. 245
6.1 Motivationp. 245
6.1.1 Empirical Observationsp. 246
6.1.2 Mathematical Modelingp. 246
6.1.2.1 Energy Terms for Bonded Atomsp. 247
6.1.2.2 Energy Terms for Nonbonded Atomsp. 249
6.1.2.3 Total Potential Energyp. 250
6.1.3 Computational Issuesp. 251
6.2 Some Simple Scripts to do Energy Calculationsp. 254
6.2.1 Linear Repulsive Energy Termsp. 254
6.2.2 An Energy Function Based on the Lennard-Jones Formulap. 255
6.2.3 Computing Energy Using Amber Parameters in Chimerap. 256
6.3 Exercisesp. 258
6.3.1 Comparing Lennard-Jones and Piecewise Linear Energy Functionsp. 258
Referencesp. 260
Chapter 7 Rotamers and Side-Chain Conformationp. 263
7.1 Motivationp. 263
7.2 Side-Chain Packing: Computational Issuesp. 264
7.3 Rotamericityp. 265
7.4 Accessing Rotamers Using a Python Scriptp. 267
7.5 Rotamers and Dihedral Anglesp. 271
7.6 A Single Side Chain and Energy Considerationsp. 271
7.7 Side-Chain Packing and Dead-End Eliminationp. 275
7.7.1 Goldstein's DEE: Basic Strategyp. 276
7.7.2 Goldstein's DEE: A More Efficient Strategyp. 278
7.7.3 Side-Chain Packingp. 278
7.8 Exercisesp. 278
7.8.1 Dead-End Eliminationp. 278
Referencesp. 279
Chapter 8 Residue Networksp. 281
8.1 Motivationp. 281
8.2 Three-Dimensional (3D) Visualization of Residue Networksp. 282
8.3 Allostery and Contact Rearrangement Networksp. 283
8.4 Exercisesp. 285
8.4.1 Spheres Representing Residuesp. 285
8.4.2 Spheres and Spindles for Residue Networksp. 286
8.4.3 Spheres and Spindles for Residue Networks: Graphical User Interface (GUI) Implementationp. 289
8.4.4 Graphs for Residue Networks: GUI Implementationp. 290
8.4.5 Contact Rearrangement Networks: Evaluating RF(i, j)p. 290
8.4.6 Displaying the Residue Network for Rearranged Contactsp. 292
Referencesp. 295
Appendix A Simple Dialogsp. 297
Appendix B Scenographicsp. 317
Appendix C The Graph Classp. 345
Appendix D 2D and 3D Plotsp. 365
Appendix E Dynamic Programmingp. 395
Indexp. 409
Go to:Top of Page