🚀 go-pugleaf

	Greetings,

	I am interested in literature pertaining to what could be
	called the "computational complexity in molecular
	biology". In particular, I am interested in viewing
	events on the molecular level as computations, and then
	applying a complexity theoretic analysis. For example, if
	one could view DNA as a (Brownian/enzymatic)
	computational device (Turing machine?), and say,
	transcription, replication, or mutation as
	functions/relations to be computed  on the device, some
	of the questions are: What is the complexity of these
	functions? What are the complexity measures? 

	There is some precedent for this sort of thing (that I
	know about) -- See for example Bennet, C., "The
	Thermodynamics of Computation - a Review", Intl. Journal
	of Theoretical Physics, Vol. 21, No. 12, 1982 for a nice
	example of an enzymatic Turning machine.  See also Landau
	and Viskin, "An Efficient String  Matching Algorithm with K
	Substitutions for Nucleotide and Amino Acid Sequences", J.
	Theo. Biol. Vol. 126, 1987 for an example of other kinds
	of work in this field.

	I would appreciate any references dealing with computational
	models based on molecular activity.

	Thanks,

	Dave



-------------------------------------------------

	David Meyer	

	Department of Computer Science
	University of Oregon
	Eugene, OR 97403-1202
	
	usenet:		{decvax, allegra}!tektronix!uoregon!meyer
	csnet:		meyer@uoregon.csnet
	internet:	meyer%uoregon.csnet@csnet-relay.arpa
			or
			meyer@cs.uoregon.edu