Emergent Computation emphasizes the interrelationship of the different classes of languages studied in mathematical linguistics (regular, context-free, context-sensitive, and type 0) with aspects to the biochemistry of DNA, RNA, and proteins. In addition, aspects of sequential machines such as parit
Emergent Computation: Emphasizing Bioinformatics (Biological and Medical Physics, Biomedical Engineering)
โ Scribed by Matthew Simon
- Publisher
- Springer
- Year
- 2005
- Tongue
- English
- Leaves
- 431
- Edition
- 2005
- Category
- Library
No coin nor oath required. For personal study only.
โฆ Synopsis
Emergent Computation emphasizes the interrelationship of the different classes of languages studied in mathematical linguistics (regular, context-free, context-sensitive, and type 0) with aspects to the biochemistry of DNA, RNA, and proteins. In addition, aspects of sequential machines such as parity checking and semi-groups are extended to the study of the Biochemistry of DNA, RNA, and proteins. Mention is also made of the relationship of algebraic topology, knot theory, complex fields, quaternions, and universal turing machines and the biochemistry of DNA, RNA, and proteins.
Emergent Computation tries to avoid an emphasis upon mathematical abstraction ("elegance") at the expense of ignoring scientific facts known to Biochemists. Emergent Computation is based entirely upon papers published by scientists in well-known and respected professional journals. These papers are based upon current research. A few examples of what is not ignored to gain "elegance":
- DNA exists as triple and quadruple strands
- Watson-Crick complementary bases have mismatches
- There can be more than four bases in DNA
- There are more than sixty-four codons
- There may be more that twenty amino acids in proteins
While Emergent Computation emphasizes bioinformatics applications, the last chapter studies mathematical linguistics applied to areas such as languages found in birds, insects, medical applications, anthropology, etc.
Emergent Computation tries to avoid unnecessary mathematical abstraction while still being rigorous. The demands made upon the knowledge of chemistry or mathematics is minimized as well. The collected technical references are valuable in itself for additional reading.
โฆ Table of Contents
Table of Contents
Preface
Introduction
Part I Emergent Computation: Bioinformatics
Chapter 1 A Review of Chemistry
Medicine
Organic Chemistry and Biochemistry
A Brief Review of Chemistry
Bonds, Lewis Acids
Chemical bonds, Lewis Acids
Chelates
Stepwise Formation Constants
Equilibrium constant
Organic Chemistry
Major Functional Groups
Structural Isomers and Tautomers
Enantiomorphic Isomers
Tautomers
Aldehydes, Ketones, and Saccharides
Haworth Projections
Biological Macromolecules
Ribose, Deoxyribose, Phospho-diesters
Pyrimidine derivatives
Purine derivatives
Nucleosides and Nucleotides
Nucleotides
Ribonucleotides
Deoxyribonucleotides
DNA as a Double Helix
Energy in Biological Systems
Amino Acids and Proteins
The Central Dogma of Genetics
Watson-Crick Complementary Base-Pairs
Replication
Transcription
Genetic Code
Genes
Operons
Protein Assembly
RNA Folding
tRNA, mRNA
Aminoacyl-tRNA Synthetases
Peptide Bond and Proteins
Transformations of DNA and RNA
Restriction Nucleases and Ligases
Ligases
Plasmids
Topoisomerases, Supercoiling
Selected Restriction Enzymes
DNA/RNA Hybrid Cleavage
Chapter 2 A Review of Aspects of Automata Theory
Flagellants
Review of Aspects of Automata Theory
Sequential Machines
Semigroups and Monoids
Linear Sequential Machines
Finite State Automata
Regular Expressions
Deterministic and Non-Deterministic FSAs
FSAs Constitute a Boolean Algebra
Chomsky Grammars
Chomsky Type 3 Grammars
Chomsky Type 2 Grammars
Homomorphism Defined
Chomsky-Schรผtzenberger Theorem
Turing Machines
Chomsky Type 0 languages
Pushdown Automata
Pushdown Automata and Chomsky Type 2 languages
Context Sensitive (Chomsky Type 1) Languages
Linear Bounded Automata
Lindenmeyer (Developmental) L Systems
Chapter 3 The Beginning Numbers
Numerology
The Beginning Numbers
Error Detection: Parity
Experiments with Alien Forms of Life
Alien Nucleotide Bases Bound as Chelates
Nucleotide Bases Viewed as Complex numbers
Aminoacyl-tRNA Synthetases and Alien Nucleotide Bases
Amino Acids Incorporated into Proteins
More than 64 Codons are Possible
Extended Watson-Crick Complements
Alternative Nucleic Acid Polymers
Chapter 4 Regular Languages: DNA and RNA
Epizootics
FSA and Regular Languages: DNA and RNA
Cut Grammars
Restriction Languages
Regular (Chomsky Type 3) Cut Grammars
Type 3 Cut Grammars for DNA and RNA
RNA Phages, Group I
The Regular (Chomsky Type 3) Language Equivalent to MS2 RNA-Phage, Group I
In Vitro Molecular Computation
Primitive Components in Molecular Computation
Finite State Automata
Ligation Method
Non-Deterministic Finite State Automata
Implementation Without Ligation
Chapter 5 Context Free Languages: DNA and RNA
Complexion
The Humors
Palindromes
Context-Free Grammars: DNA and RNA
Dyck languages and the Chomsky-Schรผtzenberger Theorem
Splicing System-Like View of DNA
Cut Grammars
Context-Free Cut Grammars
Nick Grammars
Non-Linear Context-Free Cut Grammars
Branched Hybridization Cut Languages
Circular Context-Free Cut Languages
Holliday Structures
Operons and Transformational Generative Grammars
Cytochrome-C Context-Free Protein Grammar
Pawlakโs Method
Vauquois type 2 grammar for proteins
Amino Acid Sequences for Cytochrome-C
Chapter 6 Context Sensitive Languages: DNA, RNA, Proteins
Plague
Secondary Structure Relationships
Inverted Repeats
Direct Repeats
Tandem Repeats
Unbounded Reduplication
tRNA Structures
mRNA Attenuators
Superposition
Tandem Inverted Repeats
Mutation and Rearrangement
Excision
Inversion
Recursive Secondary Structures
Pseudoknot Structure
Protein languages
Context-Sensitive Grammars and DNA
Indexed grammars
Relationship Between Grammars
Definite Clause and String Variable Grammars
Direct Repeat Context-Sensitive Grammar
Pseudoknot with Direct Repeat Grammar
Replication Fork Context-Sensitive Grammar
Context-Sensitive Grammars and Gene Regulation
Context-Sensitive Grammars for Cytochrome-C
Chapter 7 Turing Machines and SubTuring Machines
Turing Machines
Sub Turing Machines
Turing Machines that Simulate Enzyme Action
Turing Machines and DNA replication
Turing Machines and Lysis
In Vitro DNA Universal Turing Machines
In Vitro DNA Universal Turing Machine Errors
Chapter 8 Splicing Systems, H Systems
Splicing Systems and Languages
Restriction Enzymes and Splicing Languages
Linear Splicing System or an H System
Finite State Automatons and Splicing Systems
Insertion Sequences, Transposons, and Jumping Genes
Circular DNA and Splicing Systems
Hoogsteen Complements vs. Watson-Crick Complements
Dominoes
Oriented Dominoes
Splicing Systems on Graphs
Graph-Theoretic Approach to Splicing Systems
Linear Splicing on Graphs
Circular Splicing on Graphs
Chapter 9 tRNA Structure
Plague
tRNA Structure and Knot Theory
Nussinov Plots
RNA Dynamic Structural Changes
RNA Viewed as Quaternions
Stochastic Context-Free Languages and RNA
Chapter 10 Semigroups and Bioinformatics
Social Views About Tuberculosis
Finte State-Space Model of Metabolism
Semigroup for the Krebs Cycle
Part II Automata Theory and Disciplines Other than Bioinformatics
Chapter 11 Automata Theory: Non-Bioinformatics Emergent Computation
Use of Linguistic Methods in Animal Behavor
Bird Calls
The Savannah Sparrow Sings Regularly
Black-Capped Chick-a-dee (Parus atricapillus)
Foraging Bees
Medical Pathology: Touretteโs Syndrome
Geology, Meteorology, Oceanography
Closed Loop Cortisol Secretion
An Anthropologistโs View of Magic
The Algebra of Group Kinship
Appendix Shape Grammars
References
Index
A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
๐ SIMILAR VOLUMES
<P>Emergent Computation emphasizes the interrelationship of the different classes of languages studied in mathematical linguistics (regular, context-free, context-sensitive, and type 0) with aspects to the biochemistry of DNA, RNA, and proteins. In addition, aspects of sequential machines such as pa
The book presents a class of new results in molecular biology for which topological methods and ideas are important. These include: the large-scale conformation properties of DNA; computational methods (Monte Carlo) allowing the simulation of large-scale properties of DNA; the tangle model of DNA re
The book presents a class of new results in molecular biology for which topological methods and ideas are important. These include: the large-scale conformation properties of DNA; computational methods (Monte Carlo) allowing the simulation of large-scale properties of DNA; the tangle model of DNA re
The book presents a class of new results in molecular biology for which topological methods and ideas are important. These include: the large-scale conformation properties of DNA; computational methods (Monte Carlo) allowing the simulation of large-scale properties of DNA; the tangle model of DNA re