<?xml version="1.0" encoding="UTF-8"?><xml><records><record><source-app name="Biblio" version="6.x">Drupal-Biblio</source-app><ref-type>13</ref-type><contributors><authors><author><style face="normal" font="default" size="100%">Hepzibah A. Christinal</style></author><author><style face="normal" font="default" size="100%">Daniel Díaz-Pernil</style></author><author><style face="normal" font="default" size="100%">Miguel A. Gutiérrez-Naranjo</style></author><author><style face="normal" font="default" size="100%">Pedro  Real</style></author></authors></contributors><titles><title><style face="normal" font="default" size="100%">Using Membrane Computing for Effective Homology</style></title><secondary-title><style face="normal" font="default" size="100%">Applicable Algebra in Engineering, Communication and Computing</style></secondary-title></titles><keywords><keyword><style  face="normal" font="default" size="100%">Computational Algebraic Topology</style></keyword><keyword><style  face="normal" font="default" size="100%">Digital Topology</style></keyword><keyword><style  face="normal" font="default" size="100%">Effective Homology</style></keyword><keyword><style  face="normal" font="default" size="100%">Membrane computing</style></keyword><keyword><style  face="normal" font="default" size="100%">Tissue-like P systems</style></keyword></keywords><dates><year><style  face="normal" font="default" size="100%">2012</style></year><pub-dates><date><style  face="normal" font="default" size="100%">12/2012</style></date></pub-dates></dates><urls><web-urls><url><style face="normal" font="default" size="100%">http://link.springer.com/article/10.1007%2Fs00200-012-0176-6</style></url></web-urls></urls><publisher><style face="normal" font="default" size="100%">Springer Verlag</style></publisher><pub-location><style face="normal" font="default" size="100%">Berlin, Germany</style></pub-location><volume><style face="normal" font="default" size="100%">23</style></volume><pages><style face="normal" font="default" size="100%">233-249</style></pages><abstract><style face="normal" font="default" size="100%">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.</style></abstract><issue><style face="normal" font="default" size="100%">5-6</style></issue><custom1><style face="normal" font="default" size="100%">0.756</style></custom1><custom2><style face="normal" font="default" size="100%">120/247 - Q2</style></custom2></record></records></xml>