Abstract
We consider a logistic network consisting of a coupled population of externally driven logistic processing elements (LPEs) or “neurons” with quantized interactions between them. The interactions are modeled after the encoding of genetic information in molecular biology, i.e. as in DNA molecules in terms of four nucleotide bases. A unique and versatile scheme for generating complex spatio-temporal input patterns to drive the network, that could contain chaotic components, is employed to study the network's behavior. Both coherent (phase-locked) and incoherent input patterns can be generated. We find that DNA-like encoding of interactions causes quantization and clustering to appear in the activity of the network which we represent by limit-set-diagrams (LSDs). Clustering means grouping of processing elements into subpopulations with period-m orbits where m is constant for each cluster, but the values of m are different for different clusters. The clustering is found to characterize the particular input pattern being applied to the network, it changes gradually with gradual change in the input, and appears to persist even when the input pattern contains chaotic components. A striking similarity of bifurcation diagrams of isolated driven LPEs and of the LSDs generated to the bar patterns observed in gel-electropheresis of oligonucleotides and DNA fragments is observed. This could portend a useful link to molecular biology and serve as basis for introducing a molecular computing paradigm in neural networks.
An oligonucleotide is a short chain of nucleotide. It is a synthetic single stranded DNA molecule that is made with a chosen sequence of nucleotides selected from the four nucleotide bases G,C,T,A [14]. In the logistic net described here, the four nucleotide bases are replaced by the four numbers 1,2,3,4 and the oligonucleotide-like sequences produced, designated Oi s(n) and Oij(n), have elements selected from the set 1,2,3,4 equivalent to the four nucleotide bases in molecular biology.
Preview
Unable to display preview. Download preview PDF.
References
Computer, Special Issue on Molecular Computing, November, 1992.
M. Conrad, In Physics and Mathematics of the Nervous System. M. Conrad et. al. (Eds.), Springer Verlag, Berlin, 1974, pp. 82–127.
L.M. Adelman, Science, vol. 266, pp. 1021–1024, November, 1994.
R.C. Hilborn, Chaos and Nonlinear Dynamics. Oxford University Press, New York (1994).
E.M. Harth, T.J. Csermely, B. Beek and R.D. Lindsay, J. Theor. Biol., vol. 26, pp. 93–120, (1970).
P.A. Anninos, B. Beek, T.J. Csermely, E.M. Harth and G. Pertile, J. Theor. Biol., vol. 26, pp. 121–148, (1970).
E. Harth and N.S. Lewis, J. Theor. Biol. vol. 55, pp. 201–228, (1975).
M. Usher, H.G. Schuster and E. Niebur, Neural Computation, vol. 5, pp. 570–586, July, 1993.
G.M. Eldelman, Neural Dawinism: The Theory of Neuronal Group Selection, Basic Books Inc., Publishers, New York, (1987).
E. Harth, IEEE Trans. on Systems Man and Cybernetics, vol. SMC-13, pp. 728–789, Sept/Oct., 1983.
J.C. Perez and J.M. Bertille, Proc. INNS First Annual Meeting, Bopston, Sept. 1988, p. 121.
J.M. Bertille and J.C. Perez, Proc. IJCNN'90, Vol. I, L. Erlbaum Associates Publishers, Hillsdale, N.J., 1990., pp. 1–361–1–364.
K. Kaneko, in Theory and Applications of Coupled Map Lattices. K. Kaneko, Ed., J. Wiley, New York, 1993, pp. 1–49.
D. Freifelder and G.M. Malacinski, Essentials of Molecular Biology, (Second Edition), Jones and Bartlett Publishers, Boston, (1993).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Farhat, N.H., Del Moral Hernandez, E. (1995). Logistic networks with DNA-like encoding and interactions. In: Mira, J., Sandoval, F. (eds) From Natural to Artificial Neural Computation. IWANN 1995. Lecture Notes in Computer Science, vol 930. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59497-3_178
Download citation
DOI: https://doi.org/10.1007/3-540-59497-3_178
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59497-0
Online ISBN: 978-3-540-49288-7
eBook Packages: Springer Book Archive