Maximum Search Using P Systems

dc.creator	Fontana, Federico
dc.creator	Franco, Giuditta
dc.date.accessioned	2016-02-12T09:02:18Z
dc.date.available	2016-02-12T09:02:18Z
dc.date.issued	2004
dc.identifier.isbn	84-688-6101-4	es
dc.identifier.uri	http://hdl.handle.net/11441/34643
dc.description.abstract	Several algorithms of maximum search are investigated and eval- uated in different types of P systems, namely using priorities, multiple nested membranes and linked transport. The proposed solutions are expected to find application in a wide range of problems. In particular, the authors are currently working on modeling an algorithm for DNA sequence alignment using P systems.	es
dc.format	application/pdf	es
dc.language.iso	eng	es
dc.publisher	Fénix Editora	es
dc.relation.ispartof	Proceedings of the Second Brainstorming Week on Membrane Computing, 152.163. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004	es
dc.rights	Attribution-NonCommercial-NoDerivatives 4.0 Internacional	*
dc.rights.uri	http://creativecommons.org/licenses/by-nc-nd/4.0/	*
dc.title	Maximum Search Using P Systems	es
dc.type	info:eu-repo/semantics/conferenceObject	es
dc.type.version	info:eu-repo/semantics/publishedVersion	es
dc.rights.accessRights	info:eu-repo/semantics/openAccess
dc.identifier.idus	https://idus.us.es/xmlui/handle/11441/34643

Ficheros	Tamaño	Formato	Ver	Descripción
fontana.pdf	137.4Kb	[PDF]	Ver/Abrir

Excepto si se señala otra cosa, la licencia del ítem se describe como: Attribution-NonCommercial-NoDerivatives 4.0 Internacional