An overview of algorithms important to computational structural biology that addresses such topics as NMR and design and analysis of proteins.Using the tools of information technology to understand the molecular machinery of the cell offers both challenges and opportunities to computational scientists. Over the past decade, novel algorithms have been developed both for analyzing biological data and for synthetic biology problems such as protein engineering. This book explains the algorithmic foundations and computational approaches underlying areas of structural biology including NMR (nuclear magnetic resonance); X-ray crystallography; and the design and analysis of proteins, peptides, and small molecules. Each chapter offers a concise overview of important concepts, focusing on a key topic in the field. Four chapters offer a short course in algorithmic and computational issues related to NMR structural biology, giving the reader a useful toolkit with which to approach the fascinating yet thorny computational problems in this area. A recurrent theme is understanding the interplay between biophysical experiments and computational algorithms. The text emphasizes the mathematical foundations of structural biology while maintaining a balance between algorithms and a nuanced understanding of experimental data. Three emerging areas, particularly fertile ground for research students, are highlighted: NMR methodology, design of proteins and other molecules, and the modeling of protein flexibility. The next generation of computational structural biologists will need training in geometric algorithms, provably good approximation algorithms, scientific computation, and an array of techniques for handling noise and uncertainty in combinatorial geometry and computational biophysics. This book is an essential guide for young scientists on their way to research success in this exciting field.

An introductory text that emphasizes the underlying algorithmic ideas that are driving advances in bioinformatics. 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 the Author's website.

This book represents the most comprehensive and up-to-date collection of information on the topic of computational molecular biology. Bringing the most recent research into the forefront of discussion, Algorithms in Computational Molecular Biology studies the most important and useful algorithms currently being used in the field, and provides related problems. It also succeeds where other titles have failed, in offering a wide range of information from the introductory fundamentals right up to the latest, most advanced levels of study.

A look at the methods and algorithms used to predict protein structure A thorough knowledge of the function and structure of proteins is critical for the advancement of biology and the life sciences as well as the development of better drugs, higher-yield crops, and even synthetic bio-fuels. To that end, this reference sheds light on the methods used for protein structure prediction and reveals the key applications of modeled structures. This indispensable book covers the applications of modeled protein structures and unravels the relationship between pure sequence information and three-dimensional structure, which continues to be one of the greatest challenges in molecular biology. With this resource, readers will find an all-encompassing examination of the problems, methods, tools, servers, databases, and applications of protein structure prediction and they will acquire unique insight into the future applications of the modeled protein structures. The book begins with a thorough introduction to the protein structure prediction problem and is divided into four themes: a background on structure prediction, the prediction of structural elements, tertiary structure prediction, and functional insights. Within those four sections, the following topics are covered: Databases and resources that are commonly used for protein structure prediction The structure prediction flagship assessment (CASP) and the protein structure initiative (PSI) Definitions of recurring substructures and the computational approaches used for solving sequence problems Difficulties with contact map prediction and how sophisticated machine learning methods can solve those problems Structure prediction methods that rely on homology modeling, threading, and fragment assembly Hybrid methods that achieve high-resolution protein structures Parts of the protein structure that may be conserved and used to interact with other biomolecules How the loop prediction problem can be used for refinement of the modeled structures The computational model that detects the differences between protein structure and its modeled mutant Whether working in the field of bioinformatics or molecular biology research or taking courses in protein modeling, readers will find the content in this book invaluable.

This volume contains papers demonstrating the variety and richness of computational problems motivated by molecular biology. The application areas within biology that give rise to the problems studied in these papers include solid molecular modeling, sequence comparison, phylogeny, evolution, mapping, DNA chips, protein folding and 2D gel technology. The mathematical techniques used are algorithmics, combinatorics, optimization, probability, graph theory, complexity and applied mathematics. This is the fourth volume in the Discrete Applied Mathematics series on computational molecular biology, which is devoted to combinatorial and algorithmic techniques in computational molecular biology. This series publishes novel research results on the mathematical and algorithmic foundations of the inherently discrete aspects of computational biology. Key features: . protein folding . phylogenetic inference . 2-dimensional gel analysis . graphical models for sequencing by hybridisation . dynamic visualization of molecular surfaces . problems and algorithms in sequence alignment This book is a reprint of Discrete Applied Mathematics Volume 127, Number 1.

This text features detailed descriptions of methods of bio molecular sequence and structure analyses of interest to students and practitioners of bioinformatics both in the corporate and academic sectors.

Presents algorithmic techniques for solving problems in bioinformatics, including applications that shed new light on molecular biology This book introduces algorithmic techniques in bioinformatics, emphasizing their application to solving novel problems in post-genomic molecular biology. Beginning with a thought-provoking discussion on the role of algorithms in twenty-first-century bioinformatics education, Bioinformatics Algorithms covers: General algorithmic techniques, including dynamic programming, graph-theoretical methods, hidden Markov models, the fast Fourier transform, seeding, and approximation algorithms Algorithms and tools for genome and sequence analysis, including formal and approximate models for gene clusters, advanced algorithms for non-overlapping local alignments and genome tilings, multiplex PCR primer set selection, and sequence/network motif finding Microarray design and analysis, including algorithms for microarray physical design, missing value imputation, and meta-analysis of gene expression data Algorithmic issues arising in the analysis of genetic variation across human population, including computational inference of haplotypes from genotype data and disease association search in case/control epidemiologic studies Algorithmic approaches in structural and systems biology, including topological and structural classification in biochemistry, and prediction of protein-protein and domain-domain interactions Each chapter begins with a self-contained introduction to a computational problem; continues with a brief review of the existing literature on the subject and an in-depth description of recent algorithmic and methodological developments; and concludes with a brief experimental study and a discussion of open research challenges. This clear and approachable presentation makes the book appropriate for researchers, practitioners, and graduate students alike.