Formal language theory and DNA: An analysis of the generative capacity of specific recombinant behaviors

This publication has 10 references indexed in Scilit:

• Introducing efficient parallelism into approximate string matching and a new serial algorithm
  Published by Association for Computing Machinery (ACM) ,1986
• An efficient string matching algorithm withkdifferences for nudeotide and amino acid sequences
  Nucleic Acids Research, 1986
• Computation and Automata
  Published by Cambridge University Press (CUP) ,1985
• Analysis and optimization of recombinant DNA joining reactions
  Journal of Molecular Biology, 1985
• Thue systems as rewriting systems
  Lecture Notes in Computer Science, 1985
• On the syntactic structure of protein sequences and the concept of grammar complexity
  Bulletin of Mathematical Biology, 1984
• Genome structure described by formal languages
  Nucleic Acids Research, 1984
• THUE SYSTEMS AND THE CHURCH-ROSSER PROPERTY: REPLACEMENT SYSTEMS, SPECIFICATION OF FORMAL LANGUAGES, AND PRESENTATIONS OF MONOIDS††Preparation of this paper was supported in part by the National Science Foundation under grants MCS80-11979 and MCS81-16327.
  Published by Elsevier ,1983
• On grammars, complexity, and information measures of biological macromolecules
  Mathematical Biosciences, 1980
• A characterization of strictly locally testable languages and its application to subsemigroups of a free semigroup
  Information and Control, 1980