Repositorio de producción científica de la Universidad de Sevilla

A Tissue P System and a DNA Microfluidic Device for Solving the Shortest Common Superstring Problem

 

Advanced Search
 
Opened Access A Tissue P System and a DNA Microfluidic Device for Solving the Shortest Common Superstring Problem
Cites
Show item statistics
Icon
Export to
Author: Ledesma, Lucas
Manrique, Daniel
Rodríguez Patón, Alfonso
Silva, Andrés
Date: 2004
Published in: Proceedings of the Second Brainstorming Week on Membrane Computing, 281-291. Sevilla, E.T.S. de Ingeniería Informática, 2-7 de Febrero, 2004
ISBN/ISSN: 84-688-6101-4
Document type: Presentation
Abstract: This paper describes a tissue P system for solving the Shortest Common Superstring Problem in linear time. This tissue P system is well suited for parallel and distributed implementation using a micro°uidic device working with DNA strands. The tP system is not based on the usual brute force generate/test technique applied in DNA computing, but builds the space solution gradually. The possible solutions/superstrings are build step by step through the parallel distributed combination of strings using the overlapping concatenation operation. Moreover, the DNA micro°uidic device solves the problem autonomously, without the need of external control or manipulation.
Size: 153.9Kb
Format: PDF

URI: http://hdl.handle.net/11441/36330

This work is under a Creative Commons License: 
Attribution-NonCommercial-NoDerivatives 4.0 Internacional

This item appears in the following Collection(s)