• No results found

Models of natural computation : gene assembly and membrane systems

N/A
N/A
Protected

Academic year: 2021

Share "Models of natural computation : gene assembly and membrane systems"

Copied!
5
0
0

Bezig met laden.... (Bekijk nu de volledige tekst)

Hele tekst

(1)

Models of natural computation : gene assembly and membrane systems

Brijder, R.

Citation

Brijder, R. (2008, December 3). Models of natural computation : gene assembly and membrane systems. IPA Dissertation Series. Retrieved from

https://hdl.handle.net/1887/13345

Version: Corrected Publisher’s Version

License: Licence agreement concerning inclusion of doctoral thesis in the Institutional Repository of the University of Leiden

Downloaded from: https://hdl.handle.net/1887/13345

Note: To cite this publication please use the final published version (if applicable).

(2)

Bibliography

[1] The P systems web page. http://psystems.disco.unimib.it.

[2] D. Besozzi and G. Rozenberg. Formalizing spherical membrane structures and membrane proteins populations. In H.J. Hoogeboom, G. Paun, G. Rozen- berg, and A. Salomaa, editors, Workshop on Membrane Computing, volume 4361 of Lecture Notes in Computer Science, pages 18–41. Springer, 2006.

[3] P. Bottoni, C. Martín-Vide, G. Paun, and G. Rozenberg. Membrane systems with promoters/inhibitors. Acta Informatica, 38(10):695–720, 2002.

[4] N. Busi and R. Gorrieri. On the computational power of brane calculi. In C. Priami and G. Plotkin, editors, Transactions on Computational Systems Biology VI, volume 4220 of Lecture Notes in Computer Science, pages 16–43.

Springer, 2006.

[5] L. Cardelli. Brane calculi - Interactions of biological membranes. In V. Danos and V. Schachter, editors, Computational Methods in System Bi- ology (CSMB2004). Paris, France, May 2004. Revised Papers, volume 3082 of Lecture Notes in Computer Science, pages 257–280. Springer, 2005.

[6] L. Cardelli and Gh. Păun. An universality result for a (mem)brane calculus based on mate/drip operations. International Journal of Foundations of Computer Science, 17(1):49–68, 2005.

[7] M. Cavaliere and D. Sburlan. Time-independent P systems. In Mauri et al.

[18], pages 239–258.

[8] G. Ciobanu, L. Pan, Gh. Paun, and M.J. Pérez-Jiménez. P systems with minimal parallelism. Theor. Comput. Sci., 378(1):117–130, 2007.

[9] A. Cordón-Franco, M.A. Gutiérrez-Naranjo, M.J. Pérez-Jiménez, and A. Riscos-Núñez. Exploring computation trees associated with P systems.

In Mauri et al. [18], pages 278–286.

[10] V. Danos and S. Pradalier. Projective brane calculus. In V. Danos and V. Schächter, editors, CMSB, volume 3082 of Lecture Notes in Computer Science, pages 134–148. Springer, 2004.

(3)

196 BIBLIOGRAPHY

[11] J. Dassow and Gh. Păun. Regulated Rewriting in Formal Language Theory.

Springer, Berlin, 1984.

[12] R. Freund, O.H. Ibarra, Gh. Păun, and H.-C. Yen. Matrix languages, register machines, vector addition systems. In M.A. Gutiérrez-Naranjo, A. Riscos-Núñez, F.J. Romero Campero, and D. Sburlan, editors, Proceedings of the Third Brainstorming Week on Membrane Computing, RGNC Report 01/2005, pages 155–168. Dept. of Computer Sciences and Artificial Intelli- gence, Univ. of Sevilla, 2005.

[13] R. Freund, L. Kari, M. Oswald, and P. Sosík. Computationally universal P systems without priorities: Two catalysts are sufficient. Theoretical Computer Science, 330(2):251–266, 2005.

[14] S. Ginsburg and G. Rozenberg. TOL schemes and control sets. Information and Control, 27(2):109–125, 1975.

[15] H.J. Hoogeboom. Carriers and counters: P systems with carriers vs. (blind) counter automata. In M. Ito and M. Toyama, editors, Developments in Lan- guage Theory, volume 2450 of Lecture Notes in Computer Science, pages 140–151. Springer, 2002.

[16] J. Hopcroft and J. Ulmann. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.

[17] M. Ionescu and D. Sburlan. On P systems with promoters/inhibitors. Journal of Universal Computer Science, 10(5):581–599, 2004.

[18] G. Mauri, Gheorghe Paun, M.J. Pérez-Jiménez, G. Rozenberg, and A. Sa- lomaa, editors. Membrane Computing, 5th International Workshop, WMC 2004, Milan, Italy, June 14-16, 2004, Revised Selected and Invited Papers, volume 3365 of Lecture Notes in Computer Science. Springer, 2005.

[19] M. Minsky. Finite and Infinite Machines. Prentice Hall, Englewood Cliffs, New Jersey, 1967.

[20] Gh. Păun. Computing with membranes. Journal of Computer and System Sciences, 61(1):108–143, 2000. Also, Turku Center for Computer Science- TUCS Report No. 208, 1998.

[21] Gh. Păun. Membrane Computing. An Introduction. Springer, Berlin, 2002.

[22] Gh. Păun and G. Rozenberg. A guide to membrane computing. Theoretical Computer Science, 287(1):73–100, 2002.

[23] G. Rozenberg and A. Salomaa. The Mathematical Theory of L Systems.

Academic Press, New York, 1980.

[24] G. Rozenberg and A. Salomaa, editors. Handbook of Formal Languages, volume 1–3. Springer, 1997.

(4)

BIBLIOGRAPHY 197

[25] A. Salomaa. Formal Languages. Academic press, New York, 1973.

[26] G. Vaszil. On the size of P systems with minimal symport/antiport. In Mauri et al. [18], pages 404–413.

(5)

Referenties

GERELATEERDE DOCUMENTEN

Since it takes O (|u|) to generate R u,∅ , and again O (|u|) to determine the number of connected components of R u,∅ , the previous theorem implies that it takes only linear time

The reduction graph is defined in such a way that (1) each (occurrence of a) pointer of u appears twice (in unbarred form) as a vertex in the graph to represent both sides of the

We will see that, surprisingly, these rules are in a sense dual to string rewriting rules in a model of gene assembly called string pointer reduction system (SPRS) [12].. The

The SPRS consist of three types of string rewriting rules operating on legal strings while the GPRS consist of three types of graph rewriting rules operating on overlap graphs.. For

In this section we define membrane systems (also called P systems) having mem- branes marked with multisets of proteins, and using the protein-membrane rules and the protein

In this chapter we pay special attention to SC P systems where all evolution rules of the system are promoted – hence, only the rules defined in the region where the control

However, we will also consider another mode of operation, called sequential, where no antiport rules are present and at most one sr rule is applied at each step for each

In Hoofdstuk 3 blijkt bovendien dat door middel van de graaf de mogelijke volg- ordes waarin de cirkelvormige DNA-structuren ontstaan gedurende gene assembly gekarakteriseerd