A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem

DOI10.1007/s00500-004-0398-zzbMath1101.68585OpenAlexW2589342530MaRDI QIDQ2576612

Lucas Ledesma, Alfonso Rodríguez-Patón, Daniel Manrique

Publication date: 13 December 2005

Published in: Soft Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00500-004-0398-z

zbMATH Keywords

DNA computingMembrane computingMicroflow reactorShortest common superstring problem

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10)

Related Items (3)

An error-tolerant serial binary full-adder via a spiking neural P system using HP/LP basic neurons ⋮ Further remarks on DNA overlap assembly ⋮ On the overlap assembly of strings and languages

Cites Work

• On finding minimal length superstrings
• Complexity of DNA sequencing by hybridization.
• Strand design for biomolecular computation.
• Using three-dimensional microfluidic networks for solving computationally hard problems
• DNA Computing

This page was built for publication: A tissue \(P\) system and a DNA microfluidic device for solving the shortest common superstring problem