In this paper we define a general class of P systems covering some biological operations with mem... more In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.
In this paper, a nanobiosensor with surface-enhanced Raman scattering (SERS) capability is introd... more In this paper, a nanobiosensor with surface-enhanced Raman scattering (SERS) capability is introduced for highly sensitive miRNA detection in colorectal cancer. This sensor was designed and fabricated by employing a nanoshielding mechanism from nanopolystyrene beads to resist reactive ion etching and allow anisotropic electrochemical etching, producing high-aspect-ratio, surface-corrugated nanopillars (SiNPs) on a silicon wafer to create extensive hot spots along the nanopillars for improved SERS signals. SERS enhancements were correlated with nanorange roughness, indicating that hot spots along the pillars were the crucial factor to improve the SERS effect. We achieved the detection capability of a trace amount of R6G (10−8 M), and the SERS signal enhancement factor (EF) was close to 1.0 × 107 on surface-corrugated gold SiNPs. miRNA samples were also demonstrated on this sensor with good sensitivity and specificity. The target molecule miR-21-Cy5 was easily monitored through Raman ...
In this paper, we investigate the computational efficiency ofgene rearrange- ment operations foun... more In this paper, we investigate the computational efficiency ofgene rearrange- ment operations found in ciliates, a type of unicellular organisms. We show how the so-called guided recombination systems, which model this gene rear- rangement, can be used as problem solvers. Specifically, we prove that these systems can uniformly solve SAT in time O(nm) for a boolean formula of m clauses
Spiking neural P systems were recently introduced in [4] and proved to be Turing complete as numb... more Spiking neural P systems were recently introduced in [4] and proved to be Turing complete as number computing devices. In this paper we show that these systems are also computationally efficient. Specifically, we present a variant of spiking neural P systems which have, in their initial configuration, an arbitrarily large number of inactive neurons which can be activated (in an exponential number) in polynomial time. Using this model of P systems we can deterministically solve the satisfiability problem (SAT) in constant time.
We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which control... more We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which controls computations by inhibiting and de-inhibiting evolution rules. We investigate the computational power of this mechanism in both generative and accepting P systems. In partic- ular, we prove that universality can be obtained by using one catalyst. If we use only non-cooperative rules and one membrane,
P systems (known also as membrane systems) are biologi- cally motivated theoretical models of dis... more P systems (known also as membrane systems) are biologi- cally motivated theoretical models of distributed and parallel comput- ing. The two most interesting questions in the area are completeness (solving every solvable problem) and efficiency (solving a hard problem in feasible time). In this paper we define a general class of P systems covering some biological operations with membranes. We introduce a new operation, called replicative-distribution, into P systems with active membranes. This operation is well motivated from a biological point of view, and elegant from a mathematical point of view. It is both com- putationally powerful and efficient. More precisely, the P systems with active membranes using replicative-distribution rules can compute ex- actly what Turing machines can compute, and can solve NP-complete problems, particularly SAT, in linear time.
In this paper we define a general class of P systems covering some biological operations with mem... more In this paper we define a general class of P systems covering some biological operations with membranes, including evolution, communication, and modifying the membrane structure, and we describe and formally specify some of these operations: membrane merging, membrane separation, membrane release. We also investigate a particular combination of types of rules that can be used in solving the SAT problem in linear time.
In this paper, a nanobiosensor with surface-enhanced Raman scattering (SERS) capability is introd... more In this paper, a nanobiosensor with surface-enhanced Raman scattering (SERS) capability is introduced for highly sensitive miRNA detection in colorectal cancer. This sensor was designed and fabricated by employing a nanoshielding mechanism from nanopolystyrene beads to resist reactive ion etching and allow anisotropic electrochemical etching, producing high-aspect-ratio, surface-corrugated nanopillars (SiNPs) on a silicon wafer to create extensive hot spots along the nanopillars for improved SERS signals. SERS enhancements were correlated with nanorange roughness, indicating that hot spots along the pillars were the crucial factor to improve the SERS effect. We achieved the detection capability of a trace amount of R6G (10−8 M), and the SERS signal enhancement factor (EF) was close to 1.0 × 107 on surface-corrugated gold SiNPs. miRNA samples were also demonstrated on this sensor with good sensitivity and specificity. The target molecule miR-21-Cy5 was easily monitored through Raman ...
In this paper, we investigate the computational efficiency ofgene rearrange- ment operations foun... more In this paper, we investigate the computational efficiency ofgene rearrange- ment operations found in ciliates, a type of unicellular organisms. We show how the so-called guided recombination systems, which model this gene rear- rangement, can be used as problem solvers. Specifically, we prove that these systems can uniformly solve SAT in time O(nm) for a boolean formula of m clauses
Spiking neural P systems were recently introduced in [4] and proved to be Turing complete as numb... more Spiking neural P systems were recently introduced in [4] and proved to be Turing complete as number computing devices. In this paper we show that these systems are also computationally efficient. Specifically, we present a variant of spiking neural P systems which have, in their initial configuration, an arbitrarily large number of inactive neurons which can be activated (in an exponential number) in polynomial time. Using this model of P systems we can deterministically solve the satisfiability problem (SAT) in constant time.
We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which control... more We introduce in the P systems area a mechanism, inspired from neural-cell behavior, which controls computations by inhibiting and de-inhibiting evolution rules. We investigate the computational power of this mechanism in both generative and accepting P systems. In partic- ular, we prove that universality can be obtained by using one catalyst. If we use only non-cooperative rules and one membrane,
P systems (known also as membrane systems) are biologi- cally motivated theoretical models of dis... more P systems (known also as membrane systems) are biologi- cally motivated theoretical models of distributed and parallel comput- ing. The two most interesting questions in the area are completeness (solving every solvable problem) and efficiency (solving a hard problem in feasible time). In this paper we define a general class of P systems covering some biological operations with membranes. We introduce a new operation, called replicative-distribution, into P systems with active membranes. This operation is well motivated from a biological point of view, and elegant from a mathematical point of view. It is both com- putationally powerful and efficient. More precisely, the P systems with active membranes using replicative-distribution rules can compute ex- actly what Turing machines can compute, and can solve NP-complete problems, particularly SAT, in linear time.
Uploads
Papers by Tseren-Onolt Ishdorj