Name
Abstract | ||
|---|---|---|
Chemical reaction networks (CRNs) provide a fundamental model in the study of molecular systems. Widely used as formalism for the analysis of chemical and biochemical systems, CRNs have received renewed attention as a model for molecular computation. This paper demonstrates that, with a new encoding, CRNs can compute any set of polynomial functions subject only to the limitation that these functions must map the unit interval to itself. These polynomials can be expressed as linear combinations of Bernstein basis polynomials with positive coefficients less than or equal to 1. In the proposed encoding approach, each variable is represented using two molecular types: a type-0 and a type-1. The value is the ratio of the concentration of type-1 molecules to the sum of the concentrations of type-0 and type-1 molecules. The proposed encoding naturally exploits the expansion of a power-form polynomial into a Bernstein polynomials. The method is illustrated first for generic CRNs; then the chemical reactions designed for two examples are mapped to DNA strand-displacement reactions. |
Year | Venue | Field |
|---|---|---|
2016 | IEEE Global Communications Conference | Discrete mathematics,Linear combination,Polynomial,Molecule,Stochastic process,Unit interval,Bernstein polynomial,Mathematics,Encoding (memory),Computation |
DocType | ISSN | Citations |
Conference | 2334-0983 | 0 |
PageRank | References | Authors |
0.34 | 0 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sayed Ahmad Salehi | 1 | 31 | 3.78 |
| keshab k parhi | 2 | 3235 | 369.07 |
| Marc D. Riedel | 3 | 521 | 48.65 |