Computational molecular biology
Author(s)
Bibliographic Information
Computational molecular biology
（Topics in discrete mathematics, 12）
Elsevier, 2003
Available at / 9 libraries
-
No Libraries matched.
- Remove all filters.
Note
"Reprinted from the journal Discrete applied mathematics, volume 127, number 1 (2003)."
Includes bibliographical references
Description and Table of Contents
Description
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.
Table of Contents
Point matching under non-uniform distortions (T. Akutsu, K. Kanaya, A. Ohyama, A. Fujiyama) Dynamic maintenance and visualization of molecular surfaces (C.L. Bajaj, V. Pascucci, A. Shamir, R.J. Holt, A.N. Netravali) Point placement on the line by distance data (P. Damaschke) On the consistency of the minimum evolution principle of phylogenetic inference (F. Denis, O. Gascuel) Algorithm for statistical alignment of two sequences derived from a Poisson sequence length distribution (I. Miklos) Recognizing DNA graphs is difficult (R. Pendavingh, P. Schuurman, G.J. Woeginger) Weighted sequence graphs: boosting iterated dynamic programming using locally suboptimal solutions (B. Schwikowski, M. Vingron) Aligning two fragmented sequences (V. Veeramachaneni, P. Berman, W. Miller) The algorithmics of folding proteins on lattices (V. Chandru, A. DattaSharma, V.S. Anil Kumar) Approximate protein folding in the HP side chain model on extended cubic lattices (V. Heun)
by "Nielsen BookData"
