Skip to main content
SpringerLink
Log in

Editing Distances Between Membrane Structures

  • Conference paper
Membrane Computing (WMC 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3850))

Included in the following conference series:

Abstract

In this work we propose an efficient solution to calculate the minimum editing distance between membrane structures of arbitrary P systems. We use a new model of tree automata based on multisets of states and symbols linked to the finite control. This new model accepts a set of trees with symmetries between their internal nodes (mirrored trees). Once we have calculated the editing distance between an arbitrary tree and an arbitrary multiset tree automaton, we can translate the classical operations of insertion, deletion and substitution into rule applications of membrane dissolving and membrane creation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Alhazov, A., Ishdorj, T.O.: Membrane operations in P systems with active membranes. In: Păun, G., Riscos-Núñez, A., Romero-Jiménez, A., Sancho Caparrini, F. (eds.) Proceedings of the Second Brainstorming Week on Membrane Computing, TR 01/04 of RGNC, Sevilla University, pp. 37–844 (2004)

    Google Scholar 

  2. Calude, C., Păun, G., Rozenberg, G., Salomaa, A.: Multiset Processing. Mathematical, Computer Science, Molecular Computing Points of View, LNCS, vol. 2235. Springer, Heidelberg (2001)

    Book  MATH  Google Scholar 

  3. Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications (1997), Available on http://www.grappa.univ-lille3.fr/tata

  4. Csuhaj-Varjú, E., Di Nola, A., Păun, G., Pérez-Jiménez, M., Vaszil, G.: Editing configurations of P systems. In: Proc. Third Brainstorming Week on Membrane Computing, RGNC Report 01/2005, Sevilla, pp. 131–155 (2005)

    Google Scholar 

  5. Csuhaj-Varjú, E., Martín-Vide, C., Mitrana, V.: Multiset automata. In: [2], pp. 69–83

    Google Scholar 

  6. Edmonds, J., Karp, R.M.: Theoretical improvements in algorithmic efficiency for network flow problems. Journal of the ACM 19(2), 248–264 (1972)

    Article  MATH  Google Scholar 

  7. Freund, R., Oswald, M., Păun, A.: P systems generating trees. In: Mauri, G., Păun, G., Zandron, C. (eds.) Pre-proceedings of Fifth Workshop on Membrane Computing, WMC5, Milano, June 2004, MolCoNet project IST-2001-32008, pp. 221–232 (2004)

    Google Scholar 

  8. Gécseg, F., Steinby, M.: Tree languages. In: vol. 3 of [15], pp.1–69

    Google Scholar 

  9. Kudlek, M., Martín-Vide, C., Păun, G.: Towards a formal macroset theory. In: [2], pp. 123–133

    Google Scholar 

  10. López, D., Sempere, J.M., García, P.: Error correcting analysis for tree languages. International Journal of Pattern Recognition and Artificial Intelligence 14(3), 357–368 (2000)

    Article  Google Scholar 

  11. Păun, A.: On P systems with active membranes. In: Proceedings of Conference on Unconventionals Models of Computation, Brussels, pp. 187–201 (2000)

    Google Scholar 

  12. Păun, G.: Membrane Computing. An Introduction. Springer, Berlin (2002)

    MATH  Google Scholar 

  13. Păun, G., Suzuki, Y., Tanaka, H., Yokomori, T.: On the power of membrane division in P systems. Theoretical Computer Sci. 324(1), 61–85 (2004)

    Article  MATH  Google Scholar 

  14. Rivest, R.L., Cormen, T.H., Leiserson, C.E., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press and McGraw-Hill (2001)

    Google Scholar 

  15. Rozenberg, G., Salomaa, A. (eds.): Handbook of Formal Languages. Springer, Berlin (1997)

    MATH  Google Scholar 

  16. Sempere, J.M., López, D.: Recognizing membrane structures with tree automata. In: Gutiérrez Naranjo, M.A., Riscos-Núñez, A., Romero-Campero, F.J., Sburlan, D. (eds.) Proceedings of the 3rd Brainstorming Week on Membrane Computing 2005, RGNC Report 01/2005 Research Group on Natural Computing, Sevilla University, pp. 305–316. Fénix Editora (2005)

    Google Scholar 

  17. Syropoulos, A.: Mathematics of multisets. In: [2], pp. 347–358

    Google Scholar 

  18. Zhang, K.: A constrained edit distance between unordered labelled trees. Algorithmica 15, 205–222 (1996)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Departamento de Sistemas Informáticos y Computación, Universidad Politécnica de Valencia, 46071, Valencia, Spain

    Damián López & José M. Sempere

Authors
  1. Damián López
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. José M. Sempere
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Faculty of Informatics, Vienna University of Technology, Favoritenstr. 9, 1040, Vienna, Austria

    Rudolf Freund

  2. Institute of Mathematics of the Romanian Academy, PO Box 1-764, 014700, Bucureşti, Romania

    Gheorghe Păun

  3. Leiden Center of Advanced Computer Science (LIACS), Leiden University, Niels Bohrweg 1, 2333, Leiden, CA, The Netherlands

    Grzegorz Rozenberg

  4. Turku Centre for Computer Science (TUCS), Leminkäisenkatu 14, 20520, Turku, Finland

    Arto Salomaa

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

López, D., Sempere, J.M. (2006). Editing Distances Between Membrane Structures. In: Freund, R., Păun, G., Rozenberg, G., Salomaa, A. (eds) Membrane Computing. WMC 2005. Lecture Notes in Computer Science, vol 3850. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11603047_22

Download citation

  • DOI: https://doi.org/10.1007/11603047_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-30948-2

  • Online ISBN: 978-3-540-32340-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation