Using Membrane Computing for Effective Homology

TitleUsing Membrane Computing for Effective Homology
Publication TypeJournal Papers
Year of Publication2012
AuthorsChristinal, H. A., Díaz-Pernil D., Gutiérrez-Naranjo M. A., & Real P.
Journal TitleApplicable Algebra in Engineering, Communication and Computing
PublisherSpringer Verlag
Place PublishedBerlin, Germany
Volume23
Pages233-249
Date Published12/2012
Abstract

Effective Homology is an algebraic-topological method based on the computational concept of chain homotopy equivalence on a cell complex. Using this algebraic data structure, Effective Homology gives answers to some important computability problems in Algebraic Topology. In a discrete context, Effective Homology can be seen as a combinatorial layer given by a forest graph structure spanning every cell of the complex. In this paper, by taking as input a pixel-based 2D binary object, we present a logarithmic-time uniform solution for describing a chain homotopy operator ϕ for its adjacency graph. This solution is based on Membrane Computing techniques applied to the spanning forest problem and it can be easily extended to higher dimensions.

KeywordsComputational Algebraic Topology, Digital Topology, Effective Homology, Membrane computing, Tissue-like P systems
URLhttp://link.springer.com/article/10.1007%2Fs00200-012-0176-6
Issue5-6
Impact Factor

0.756

Ranking

120/247 - Q2

ISSN Number0938-1279
DOI10.1007/s00200-012-0176-6