Karl-Heinz Zimmermann – författare

Sir Francis Crick would undoubtedly be at the front of the line ordering this fascinating book. Being one of the discoverers of DNA, he would be amazed at how his work has been applied to mankind''s most important invention, the computer. DNA contains the genetic instructions for the biological development of cellular life forms or viruses. DNA computing uses DNA as a substrate for storing information, while molecular biological operations are used to manipulate this information.

DNA Computing Models begins with a comprehensive introduction to the field of DNA computing. This book emphasizes computational methods to tackle central problems of DNA computing, such as controlling living cells, building patterns, and generating nanomachines. DNA Computing Models presents laboratory-scale human-operated models of computation, including a description of the first experiment of DNA computation conducted by Adleman in 1994. It provides molecular-scale autonomous models of computation and addresses the design of computational devices working in living cells. It also addresses the important problem of proper word design for DNA computing.

DNA Computing Models is designed for researchers and advanced-level students in computers science, bioengineering and molecular biology as a reference or secondary text book. This book is also suitable for practitioners in industry.

Protein informatics is a newer name for an already existing discipline. It encompasses the techniques used in bioinformatics and molecular modeling that are related to proteins. While bioinformatics is mainly concerned with the collection, organization, and analysis of biological data, molecular modeling is devoted to representation and manipulation of the structure of proteins.

Protein informatics requires substantial prerequisites on computer science, mathematics, and molecular biology. The approach chosen here, allows a direct and rapid grasp on the subject starting from basic knowledge of algorithm design, calculus, linear algebra, and probability theory.

An Introduction to Protein Informatics, a professional monograph will provide the reader a comprehensive introduction to the field of protein informatics. The text emphasizes mathematical and computational methods to tackle the central problems of alignment, phylogenetic reconstruction, and prediction and sampling of protein structure.

An Introduction to Protein Informatics is designed for a professional audience, composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduate-level text for students in computer science, mathematics, and biomedicine.

Protein informatics is a newer name for an already existing discipline. It encompasses the techniques used in bioinformatics and molecular modeling that are related to proteins. While bioinformatics is mainly concerned with the collection, organization, and analysis of biological data, molecular modeling is devoted to representation and manipulation of the structure of proteins.

Protein informatics requires substantial prerequisites on computer science, mathematics, and molecular biology. The approach chosen here, allows a direct and rapid grasp on the subject starting from basic knowledge of algorithm design, calculus, linear algebra, and probability theory.

An Introduction to Protein Informatics, a professional monograph will provide the reader a comprehensive introduction to the field of protein informatics. The text emphasizes mathematical and computational methods to tackle the central problems of alignment, phylogenetic reconstruction, and prediction and sampling of protein structure.

An Introduction to Protein Informatics is designed for a professional audience, composed of researchers and practitioners within bioinformatics, molecular modeling, algorithm design, optimization, and pattern recognition. This book is also suitable as a graduate-level text for students in computer science, mathematics, and biomedicine.

In diesem essential werden wesentliche Konzepte der Berechenbarkeitstheorie erörtert. Zunächst werden unterschiedliche Modelle der Berechenbarkeit eingeführt und ihre semantische Gleichwertigkeit gezeigt. Dieses Resultat steht in Einklang mit der Church-Turing-These, nach der jede intuitiv berechenbare Funktion partiell-rekursiv ist. Neben zentralen Instrumenten der Berechenbarkeit, wie etwa der Gödelisierung von berechenbaren Funktionen und der Existenz universeller berechenbarer Funktionen, stehen unentscheidbare Probleme im Fokus, wie etwa das Halteproblem sowie das Wortproblem für die Term-Ersetzung. Semi-entscheidbare Mengen werden beleuchtet und die zentralen Sätze von Rice und Rice-Shapiro werden skizziert.