DNA Computing
From MaRDI portal
Publication:5494359
DOI10.1007/B136914zbMath1116.68463OpenAlexW4248466611MaRDI QIDQ5494359
Mario J. Pérez-Jiménez, Victor Mitrana, Maurice Margenstern
Publication date: 19 October 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/b136914
Related Items (28)
On the recognition of context-free languages using accepting hybrid networks of evolutionary processors ⋮ Simulating polarization by random context filters in networks of evolutionary processors ⋮ All NP-problems can be solved in polynomial time by accepting hybrid networks of evolutionary processors of constant size ⋮ On the number of nodes in universal networks of evolutionary processors ⋮ Accepting networks of splicing processors: complexity results ⋮ Unnamed Item ⋮ Small networks of polarized splicing processors are universal ⋮ Networks of polarized evolutionary processors ⋮ Networks of picture processors as problem solvers ⋮ On the computational power of networks of polarized evolutionary processors ⋮ Filters defined by random contexts versus polarization in networks of evolutionary processors ⋮ Accepting networks of evolutionary processors with subregular filters ⋮ Computational completeness of complete, star-like, and linear hybrid networks of evolutionary processors with a small number of processors ⋮ Complexity-preserving simulations among three variants of accepting networks of evolutionary processors ⋮ Small universal accepting hybrid networks of evolutionary processors ⋮ On the size complexity of hybrid networks of evolutionary processors ⋮ The role of evolutionary operations in accepting hybrid networks of evolutionary processors ⋮ On the size of computationally complete hybrid networks of evolutionary processors ⋮ Accepting networks of genetic processors are computationally complete ⋮ Complexity results for deciding networks of evolutionary processors ⋮ On small, reduced, and fast universal accepting networks of splicing processors ⋮ On Accepting Networks of Evolutionary Processors with at Most Two Types of Nodes ⋮ Polarization: a new communication protocol in networks of bio-inspired processors ⋮ Networks with Evolutionary Processors and Ideals and Codes as Filters ⋮ Accepting Networks of Non-inserting Evolutionary Processors ⋮ A survey on computationally complete accepting and generating networks of evolutionary processors ⋮ Accepting networks of evolutionary processors with resources restricted and structure limited filters ⋮ Generating and accepting P systems with minimal left and right insertion and deletion
This page was built for publication: DNA Computing
