Abstract
Membrane computing is a recently introduced (very general) computing framework which abstracts from the way the living cells process chemical compounds in their compartmental structure. Many variants considered in the literature are computationally universal and/or able to solve NP-complete problems in polynomial (even linear) time — of course, by making use of an exponential working space created in a natural way (for instance, by membrane division).
In the present paper we propose a general class of membrane systems, where besides rules for objects evolution (the objects are described by strings over a finite alphabet), there are rules for moving objects from a compartment to another one (this is done conditionally, depending on the strings contents), and for handling membranes. Especially this latter feature is important (and new in many respects), because it makes possible to interpret several DNA computing experiments as membrane computations. Specifically, rules for dividing membranes (with the contents replicated or separated according to a given property of strings), creating, merging, or dissolving them are considered. Some of these variants generalize certain previous variants of membrane systems, for the new variants we investigate their power and computational efficiency (as expected, universality results, as well as polynomial solutions of NP-complete problems are found; the latter case is illustrated with the SAT problem).
Due to space restrictions, the paper is a preliminary, partially formalized one; more mathematical details are given in the appendices available at http://bioinformatics.bio.disco.unimib.it/psystems, where also current information about the membrane computing area can be found.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
L. M. Adleman, On constructing a molecular computer, in [9], 1–22.
P. Bottoni, A. Labella, C. Martin-Vide, and Gh. Păun, Rewriting P systems with conditional communication, submitted, 2000.
D. Bray, Protein molecules as computational elements in living cells, Nature 376 (1995), 307–312.
C. Calude and Gh. Păun, Computing with Cells and Atoms, Taylor and Francis, London, 2000.
J. Castellanos, A. Rodriguez-Paton, and Gh. Păun, Computing with membranes: P systems with worm-objects, IEEE 7th. Intern. Conf. on String Processing and Information Retrieval, SPIRE 2000, La Coruna, Spain, 64–74.
T. Head, Aqueous simulations of membrane computations, Romanian J. of Information Science and Technology, 4,1–2 (2001).
M. Ito, C. Martin-Vide, and Gh. Păun, A characterization of Parikh sets of ET0L languages in terms of P systems, in vol. Words, Semigroups, and Transductions (M. Ito, Gh. Păun, and S. Yu, eds.), Word Scientific Publ., Singapore, 2001.
R. J. Lipton, Speeding up computations via molecular biology, in [9], 67–74.
R. J. Lipton and E. B. Baum, eds., DNA Based Computers, Proc. of a DIMACS Workshop, Princeton, 1995, Amer. Math. Soc., 1996.
W. R. Loewenstein, The Touchstone of Life. Molecular Information, Cell Communication, and the Foundations of Life, Oxford Univ. Press, New York, 1999.
Gh. Păun, Computing with membranes, Journal of Computer and System Sciences, 61,1 (2000), 108–143.
Gh. Păun, P systems with active membranes: Attacking NP-complete problems, J. Automata, Languages and Combinatorics, 6,1 (2001), 75–90.
Gh. Păun, G. Rozenberg, and A. Salomaa, DNA Computing. New Computing Paradigms, Springer-Verlag, Berlin, 1998.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Margenstern, M., Martín-Vide, C., Păun, G. (2002). Computing with Membranes: Variants with an Enhanced Membrane Handling. In: Jonoska, N., Seeman, N.C. (eds) DNA Computing. DNA 2001. Lecture Notes in Computer Science, vol 2340. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-48017-X_32
Download citation
DOI: https://doi.org/10.1007/3-540-48017-X_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43775-8
Online ISBN: 978-3-540-48017-4
eBook Packages: Springer Book Archive