Loading [MathJax]/jax/element/mml/optable/GeneralPunctuation.js
Research article

Computational enzymology for degradation of chemical warfare agents: promising technologies for remediation processes

  • Received: 15 December 2016 Accepted: 14 February 2017 Published: 14 March 2017
  • Chemical weapons are a major worldwide problem, since they are inexpensive, easy to produce on a large scale and difficult to detect and control. Among the chemical warfare agents, we can highlight the organophosphorus compounds (OP), which contain the phosphorus element and that have a large number of applications. They affect the central nervous system and can lead to death, so there are a lot of works in order to design new effective antidotes for the intoxication caused by them. The standard treatment includes the use of an anticholinergic combined to a central nervous system depressor and an oxime. Oximes are compounds that reactivate Acetylcholinesterase (AChE), a regulatory enzyme responsible for the transmission of nerve impulses, which is one of the molecular targets most vulnerable to neurotoxic agents. Increasingly, enzymatic treatment becomes a promising alternative; therefore, other enzymes have been studied for the OP degradation function, such as phosphotriesterase (PTE) from bacteria, human serum paraoxonase 1 (HssPON1) and diisopropyl fluorophosphatase (DFPase) that showed significant performances in OP detoxification. The understanding of mechanisms by which enzymes act is of extreme importance for the projection of antidotes for warfare agents, and computational chemistry comes to aid and reduce the time and costs of the process. Molecular Docking, Molecular Dynamics and QM/MM (quantum-mechanics/molecular-mechanics) are techniques used to investigate the molecular interactions between ligands and proteins.

    Citation: Alexandre A. de Castro, Letícia C. Assis, Daniela R. Silva, Silviana Corrêa, Tamiris M. Assis, Giovanna C. Gajo, Flávia V. Soares, Teodorico C. Ramalho. Computational enzymology for degradation of chemical warfare agents: promising technologies for remediation processes[J]. AIMS Microbiology, 2017, 3(1): 108-135. doi: 10.3934/microbiol.2017.1.108

    Related Papers:

    [1] Kazuo Sano . Intelligence and global bias in the stock market. Data Science in Finance and Economics, 2023, 3(2): 184-195. doi: 10.3934/DSFE.2023011
    [2] Aihua Li, Qinyan Wei, Yong Shi, Zhidong Liu . Research on stock price prediction from a data fusion perspective. Data Science in Finance and Economics, 2023, 3(3): 230-250. doi: 10.3934/DSFE.2023014
    [3] Jin Zeng, Yijia Zhang, Yun Yin, Peter G Moffatt . The effect of the Covid pandemic on stock market volatility: Separating initial impact from time-to-recovery. Data Science in Finance and Economics, 2024, 4(4): 531-547. doi: 10.3934/DSFE.2024022
    [4] Bilal Ahmed Memon, Hongxing Yao . Correlation structure networks of stock market during terrorism: evidence from Pakistan. Data Science in Finance and Economics, 2021, 1(2): 117-140. doi: 10.3934/DSFE.2021007
    [5] Zimei Huang, Zhenghui Li . What reflects investor sentiment? Empirical evidence from China. Data Science in Finance and Economics, 2021, 1(3): 235-252. doi: 10.3934/DSFE.2021013
    [6] Nurun Najwa Bahari, Hafizah Bahaludin, Munira Ismail, Fatimah Abdul Razak . Network, correlation, and community structure of the financial sector of Bursa Malaysia before, during, and after COVID-19. Data Science in Finance and Economics, 2024, 4(3): 362-387. doi: 10.3934/DSFE.2024016
    [7] Deniz Sevinç . Volatility spillovers among MIST stock markets. Data Science in Finance and Economics, 2022, 2(2): 80-95. doi: 10.3934/DSFE.2022004
    [8] Kuo-Shing Chen . Interlinkages between Bitcoin, green financial assets, oil, and emerging stock markets. Data Science in Finance and Economics, 2024, 4(1): 160-187. doi: 10.3934/DSFE.2024006
    [9] Yi Chen, Zhehao Huang . Measuring the effects of investor attention on China's stock returns. Data Science in Finance and Economics, 2021, 1(4): 327-344. doi: 10.3934/DSFE.2021018
    [10] Alejandro Rodriguez Dominguez, Om Hari Yadav . A causal interactions indicator between two time series using extreme variations in the first eigenvalue of lagged correlation matrices. Data Science in Finance and Economics, 2024, 4(3): 422-445. doi: 10.3934/DSFE.2024018
  • Chemical weapons are a major worldwide problem, since they are inexpensive, easy to produce on a large scale and difficult to detect and control. Among the chemical warfare agents, we can highlight the organophosphorus compounds (OP), which contain the phosphorus element and that have a large number of applications. They affect the central nervous system and can lead to death, so there are a lot of works in order to design new effective antidotes for the intoxication caused by them. The standard treatment includes the use of an anticholinergic combined to a central nervous system depressor and an oxime. Oximes are compounds that reactivate Acetylcholinesterase (AChE), a regulatory enzyme responsible for the transmission of nerve impulses, which is one of the molecular targets most vulnerable to neurotoxic agents. Increasingly, enzymatic treatment becomes a promising alternative; therefore, other enzymes have been studied for the OP degradation function, such as phosphotriesterase (PTE) from bacteria, human serum paraoxonase 1 (HssPON1) and diisopropyl fluorophosphatase (DFPase) that showed significant performances in OP detoxification. The understanding of mechanisms by which enzymes act is of extreme importance for the projection of antidotes for warfare agents, and computational chemistry comes to aid and reduce the time and costs of the process. Molecular Docking, Molecular Dynamics and QM/MM (quantum-mechanics/molecular-mechanics) are techniques used to investigate the molecular interactions between ligands and proteins.


    Mathematical models of physics, chemistry, ecology, physiology, psychology, engineering and social sciences have been governed by differential equation and difference equation. With the development of computers, compared with continuous-time model, discrete-time models described by difference equations are better formulated and analyzed in the past decades. Recently laser model has vast application in medical sciences, industries, highly security areas in army [1,2,3,4,5,6,7]. Laser, whose basic principal lies on the Einstein theory of light proposed in 1916, is a device that produces intense beam of monochromatic and coherent light. Since then it is developed by Gordon Gould in 1957. In 1960, the first working ruby laser was invented by Theodore Maiman. Laser light is coherent, highly directional and monochromatic which makes it different from ordinary light. The working principle of laser is based on the spontaneous absorption, spontaneous emission, stimulated emission, and population inversion are essential for the laser formation. The readers can refer to [8,9,10]. For instance, Hakin [11] proposed a simple continuous-time laser model in 1983. Khan and Sharif [12] proposed a discrete-time laser model and studied extensively dynamical properties about fixed points, the existence of prime period and periodic points, and transcritical bifurcation of a one-dimensional discrete-time laser model in R+.

    In fact, the identification of the parameters of the model is usually based on statistical method, starting from data experimentally obtained and on the choice of some method adapted to the identification. These models, even the classic deterministic approach, are subjected to inaccuracies (fuzzy uncertainty) that can be caused by the nature of the state variables, by parameters as coefficients of the model and by initial conditions. In fact, fuzzy difference equation is generation of difference equation whose parameters or the initial values are fuzzy numbers, and its solutions are sequences of fuzzy numbers. It has been used to model a dynamical systems under possibility uncertainty. Due to the applicability of fuzzy difference equation for the analysis of phenomena where imprecision is inherent, this class of difference equation is a very important topic from theoretical point of view and also its applications. Recently there has been an increasing interest in the study of fuzzy difference equations (see [13,14,15,16,17,18,19,20,21,22,23,24,25]).

    In this paper, by virtue of the theory of fuzzy sets, we consider the following discrete-time laser model with fuzzy uncertainty parameters and initial conditions.

    xn+1=Axn+BxnCxn+H,n=0,1,, (1.1)

    where xn is the number of laser photon at the nth time, A,B,C,H and the initial value x0 are positive fuzzy numbers.

    The main aim of this work is to study the existence of positive solutions of discrete-time laser model (1.1). Furthermore, according to a generation of division (g-division) of fuzzy numbers, we derive some conditions so that every positive solution of discrete-time laser model (1.1) is bounded. Finally, under some conditions we prove that discrete-time laser model (1.1) has a fixed point 0 which is asymptotically stable, and a unique positive fixed point x.

    Firstly, we give the following definitions and lemma needed in the sequel.

    Definition 2.1.[26] u:R[0,1] is said to be a fuzzy number if it satisfies conditions (i)–(iv) written below:

    (i) u is normal, i. e., there exists an xR such that u(x)=1;

    (ii) u is fuzzy convex, i. e., for all t[0,1] and x1,x2R such that

    u(tx1+(1t)x2)min{u(x1),u(x2)};

    (iii) u is upper semicontinuous;

    (iv) The support of u, suppu=¯α(0,1][u]α=¯{x:u(x)>0} is compact.

    For α(0,1], the αcuts of fuzzy number u is [u]α={xR:u(x)α} and for α=0, the support of u is defined as suppu=[u]0=¯{xR|u(x)>0}.

    A fuzzy number can also be described by a parametric form.

    Definition 2.2. [26] A fuzzy number u in a parametric form is a pair (ul,ur) of functions ul,ur,0α1, which satisfies the following requirements:

    (i) ul(α) is a bounded monotonic increasing left continuous function,

    (ii) ur(α) is a bounded monotonic decreasing left continuous function,

    (iii) ul(α)ur(α),0α1.

    A crisp (real) number x is simply represented by (ul(α),ur(α))=(x,x),0α1. The fuzzy number space {(ul(α),ur(α))} becomes a convex cone E1 which could be embedded isomorphically and isometrically into a Banach space (see [26]).

    Definition 2.3.[26] The distance between two arbitrary fuzzy numbers u and v is defined as follows:

    D(u,v)=supα[0,1]max{|ul,αvl,α|,|ur,αvr,α|}. (2.1)

    It is clear that (E1,D) is a complete metric space.

    Definition 2.4.[26] Let u=(ul(α),ur(α)),v=(vl(α),vr(α))E1,0α1, and kR. Then

    (i) u=v iff ul(α)=vl(α),ur(α)=vr(α),

    (ii) u+v=(ul(α)+vl(α),ur(α)+vr(α)),

    (iii) uv=(ul(α)vr(α),ur(α)vl(α)),

    (iv) ku={(kul(α),kur(α)),k0;(kur(α),kul(α)),k<0,

    (v) uv=(min{ul(α)vl(α),ul(α)vr(α),ur(α)vl(α),ur(α)vr(α)},max{ul(α)vl(α),ul(α)vr(α),ur(α)vl(α),ur(α)vr(α)}).

    Definition 2.5. [27] Suppose that u,vE1 have α-cuts [u]α=[ul,α,ur,α],[v]α=[vl,α,vr,α], with 0[v]α,α[0,1]. The generation of division (g-division) ÷g is the operation that calculates the fuzzy number s=u÷gv having level cuts [s]α=[sl,α,sr,α](here [u]α1=[1/ur,α,1/ul,α]) defined by

    [s]α=[u]α÷g[v]α{(i)[u]α=[v]α[s]α,or(ii)[v]α=[u]α[s]α1 (2.2)

    provided that s is a proper fuzzy number sl,α is nondecreasing, sr,α is nonincreasing, sl,1sr,1.

    Remark 2.1. According to [27], in this paper the fuzzy number is positive, if u÷gv=sE1 exists, then the following two cases are possible

    Case I. if ul,αvr,αur,αvl,α,α[0,1], then sl,α=ul,αvl,α,sr,α=ur,αvr,α,

    Case II. if ul,αvr,αur,αvl,α,α[0,1], then sl,α=ur,αvr,α,sr,α=ul,αvl,α.

    Definition 2.6. [26] A triangular fuzzy number (TFN) denoted by A is defined as (a,b,c) where the membership function

    A(x)={0,xa;xaba,axb;1,x=b;cxcb,bxc;0,xc.

    The αcuts of A=(a,b,c) are described by [A]α={xR:A(x)α}=[a+α(ba),cα(cb)]=[Al,α,Ar,α], α[0,1], it is clear that [A]α are closed interval. A fuzzy number A is positive if suppA(0,).

    The following proposition is fundamental since it characterizes a fuzzy set through the α-levels.

    Proposition 2.1.[26] If {Aα:α[0,1]} is a compact, convex and not empty subset family of Rn such that

    (i) ¯AαA0.

    (ii) Aα2Aα1 if α1α2.

    (iii) Aα=k1Aαk if αkα>0.

    Then there is uEn(En denotes n dimensional fuzzy number space) such that [u]α=Aα for all α(0,1] and [u]0=¯0<α1AαA0.

    The fuzzy analog of the boundedness and persistence (see [15,16]) is as follows:

    Definition 2.7. A sequence of positive fuzzy numbers (xn) is persistence (resp. bounded) if there exists a positive real number M (resp. N) such that

    supp xn[M,)(resp. supp xn(0,N]),n=1,2,,

    A sequence of positive fuzzy numbers (xn) is bounded and persistence if there exist positive real numbers M,N>0 such that

    supp xn[M,N],n=1,2,.

    A sequence of positive fuzzy numbers (xn),n=1,2,, is an unbounded if the norm is an unbounded sequence.

    Definition 2.8. x_n is a positive solution of (1.1) if (x_n) is a sequence of positive fuzzy numbers which satisfies (1.1). A positive fuzzy number x is called a positive equilibrium of (1.1) if

    x = Ax+\frac{Bx}{Cx+H}.

    Let (x_n) be a sequence of positive fuzzy numbers and x is a positive fuzzy number, x_n \rightarrow x as n\rightarrow\infty if \lim_{n\rightarrow\infty}D(x_n, x) = 0 .

    Lemma 2.1. [26] Let f: R^+\times R^+\times R^+\times R^+\rightarrow R^+ be continuous, A, B, C, D are fuzzy numbers. Then

    \begin{equation} [f(A, B, C, D)]^\alpha = f([A]^\alpha, [B]^\alpha, [C]^\alpha, [D]^\alpha), \ \ \alpha\in(0, 1]. \end{equation} (2.3)

    Firstly we give the existence of positive solutions of discrete-time laser model with fuzzy environment.

    Theorem 3.1. Let parameters A, B, C, H and initial value x_0 of discrete-time laser model be fuzzy numbers. Then, for any positive fuzzy number x_0 , there exists a unique positive solution x_n of discrete-time laser model with initial conditions x_0 .

    Proof. The proof is similar to those of Proposition 2.1 [25]. So we omit the proof of Theorem 3.1.

    Noting Remark 2.1, taking \alpha -cuts, one of the following two cases holds

    Case I

    \begin{equation} [x_{n+1}]^\alpha = [L_{n+1, \alpha}, R_{n+1, \alpha}] = \left[A_{l, \alpha}L_{n, \alpha}+\frac{B_{l, \alpha}L_{n, \alpha}}{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}, A_{r, \alpha}R_{n, \alpha}+\frac{B_{r, \alpha}R_{n, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}\right] \end{equation} (3.1)

    Case II

    \begin{equation} [x_{n+1}]^\alpha = [L_{n+1, \alpha}, R_{n+1, \alpha}] = \left[A_{l, \alpha}L_{n, \alpha}+\frac{B_{r, \alpha}R_{n, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}, A_{r, \alpha}R_{n, \alpha}+\frac{B_{l, \alpha}L_{n, \alpha}}{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}\right] \end{equation} (3.2)

    To study the dynamical behavior of the positive solutions of discrete-time laser model (1.1), according to Definition 2.5, we consider two cases.

    First, if Case I holds true, we need the following lemma.

    Lemma 3.1. Consider the following difference equation

    \begin{equation} y_{n+1} = ay_n+\frac{by_n}{c y_{n}+h}, \ \ n = 0, 1, \cdots, \end{equation} (3.3)

    where a\in(0, 1), b, c, h\in(0, +\infty), y_0\in(0, +\infty) , then the following statements are true:

    (i) Every positive solution of (3.3) satisfies

    \begin{equation} 0 \lt y_n\le\frac{b}{c(1-a)}+y_0. \end{equation} (3.4)

    (ii) The equation has a fixed point y^* = 0 if b\le (1-a)h.

    (iii) The equation has two fixed points y^* = 0, y^* = \frac{b}{c(1-a)}-\frac{h}{c} if b > (1-a)h .

    Proof. (i) Let y_n be a positive solution of (3.3). It follows from (3.3) that, for n\ge 0,

    0 \lt y_{n+1} = ay_n+\frac{by_n}{cy_n+h}\le ay_n+\frac{b}{c}.

    From which we have

    0 \lt y_n\le\frac{b}{c(1-a)}+\left(y_0-\frac{b}{c(1-a)}\right)a^{n+1}\le\frac{b}{c(1-a)}+y_0.

    This completes the proof of (i).

    If y^* is fixed point of (3.3), i.e., y_n = y^*. So from (3.3), we have

    \begin{equation} y^* = ay^*+\frac{by^*}{cy^*+h}. \end{equation} (3.5)

    After some manipulation, from (3.5), we can get

    \begin{equation} y^* = 0, \ \ y^* = \frac{b}{c(1-a)}-\frac{h}{c}. \end{equation} (3.6)

    From (3.3), we can summarized the existence of fixed points as follows

    (ii) If b < h(1-a) , then y^* = \frac{b}{c(1-a)}-\frac{h}{c} is not a positive number. And hence if b\le h(1-a) then (3.3) has a fixed point y^* = 0 .

    (iii) If b > h(1-a) , then y^* = \frac{b}{c(1-a)}-\frac{h}{c} is a positive number. And hence if b > h(1-a) then (3.3) has two fixed points y^* = 0, y^* = \frac{b}{c(1-a)}-\frac{h}{c} .

    Proposition 3.1. The following statements hold true

    (i) The fixed point y^* = 0 of (3.3) is stable if b < (1-a)h .

    (ii) The fixed point y^* = 0 of (3.3) is unstable if b > (1-a)h .

    (iii) The fixed point y^* = 0 of (3.3) is non-hyperbolic if b = (1-a)h .

    Proof. From (3.3), let

    \begin{equation} f(y): = ay+\frac{by}{cy+h} \end{equation} (3.7)

    From (3.7), it follows that

    \begin{equation} f'(y) = a+\frac{bh}{(cy+h)^2} \end{equation} (3.8)

    From (3.8), it can get

    \begin{equation} \left|f'(y)|_{y^* = 0}\right| = \left|a+\frac{b}{h}\right| \end{equation} (3.9)

    Therefore from (3.9), it can conclude that y^* = 0 is stable if b < (1-a)h , unstable if b > (1-a)h , non-hyperbolic if b = (1-a)h .

    Proposition 3.2. The fixed point y^* = \frac{b}{c(1-a)}-\frac{h}{c} of (3.3) is globally asymptotically stable if b > (1-a)h .

    Proof. From (3.8), it can get

    \begin{equation} \left|f'(y)|_{y^* = \frac{b}{c(1-a)}-\frac{h}{c}}\right| = \left|a+\frac{h(1-a)^2}{b}\right|. \end{equation} (3.10)

    Therefore from (3.10), it can conclude that, if a+\frac{h(1-a)^2}{b} < 1 , i.e., b > (1-a)h then the fixed point y^* = \frac{b}{c(1-a)}-\frac{h}{c} is stable.

    On the other hand, it follows from (3.4) that (y_n) is bounded. And from (3.8), we have f'(y) > 0 . Namely (y_n) is monotone increasing. So we have

    \begin{equation} \lim\limits_{n\rightarrow\infty}y_n = y^* = \frac{b}{c(1-a)}-\frac{h}{c}. \end{equation} (3.11)

    Therefore the fixed point y^* = \frac{b}{c(1-a)}-\frac{h}{c} is globally asymptotically stable.

    Proposition 3.3. The fixed point y^* = 0 of (3.3) is globally asymptotically stable if b < (1-a)h .

    Proof. From (3.3), we can get that

    \begin{equation} y_{n+1}\le (a+\frac{b}{h})y_n \end{equation} (3.12)

    From (3.12), it follows that

    \begin{equation} \begin{array}{c} y_1\le(a+\frac{b}{h})y_0\\ \mbox{}\\ y_2\le(a+\frac{b}{h})^2y_0\\ \vdots\\ y_n\le(a+\frac{b}{h})^ny_0 \end{array} \end{equation} (3.13)

    Since b < (1-a)h , then \lim_{n\rightarrow\infty}y_n = 0 . Therefore the fixed point y^* = 0 of (3.3) is globally asymptotically stable.

    Theorem 3.2. Consider discrete-time laser model (1.1), where A, B, C, H and initial value x_0 are positive fuzzy numbers. There exists positive number N_A , \forall \alpha\in(0, 1] , A_{r, \alpha} < N_A < 1 . If

    \begin{equation} \frac{B_{l, \alpha}L_{n, \alpha}}{B_{r, \alpha}R_{n, \alpha}}\le \frac{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}, \forall \alpha\in(0, 1]. \end{equation} (3.14)

    and

    \begin{equation} B_{l, \alpha} \lt H_{l, \alpha}(1-A_{l, \alpha}), \ \ \ B_{r, \alpha} \lt H_{r, \alpha}(1-A_{r, \alpha}), \ \ \forall \alpha\in(0, 1]. \end{equation} (3.15)

    Then (1.1) has a fixed point x^* = 0 which is globally asymptotically stable.

    Proof. Since A, B, C, H are positive fuzzy numbers and (3.14) holds true, taking \alpha -cuts of model (1.1) on both sides, we can have the following difference equation system with parameters

    \begin{equation} L_{n+1, \alpha} = A_{l, \alpha}L_{n, \alpha}+\frac{B_{l, \alpha}L_{n, \alpha}}{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}, \ \ R_{n+1, \alpha} = A_{r, \alpha}R_{n, \alpha}+\frac{B_{r, \alpha}R_{n, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}. \end{equation} (3.16)

    Since (3.15) holds true, using Proposition 3.2, we can get

    \begin{equation} \lim\limits_{n\rightarrow\infty}L_{n, \alpha} = 0, \ \ \lim\limits_{n\rightarrow\infty}R_{n, \alpha} = 0. \end{equation} (3.17)

    On the other hand, let x_n = x^* , where [x_n]^\alpha = [L_{n, \alpha}, R_{n, \alpha}] = [L_\alpha, R_\alpha] = [x^*]^\alpha, \alpha\in(0, 1] , be the fixed point of (1.1). From (3.16), one can get

    \begin{equation} L_{\alpha} = A_{l, \alpha}L_{\alpha}+\frac{B_{l, \alpha}L_{\alpha}}{C_{l, \alpha}L_{\alpha}+H_{l, \alpha}}, \ \ R_{\alpha} = A_{r, \alpha}R_{\alpha}+\frac{B_{r, \alpha}R_{\alpha}}{C_{r, \alpha}R_{\alpha}+H_{r, \alpha}}. \end{equation} (3.18)

    Since (3.15) is satisfied, from (3.16), it follows that

    \begin{equation} L_\alpha = 0, \ \ R_\alpha = 0, \ \lim\limits_{n\rightarrow\infty}D(x_n, x^*) = \lim\limits_{n\rightarrow\infty}\sup\limits_{\alpha\in(0, 1]}\{\max\{|L_{n, \alpha}-L_\alpha|, |R_{n, \alpha}-R_\alpha|\}\} = 0. \end{equation} (3.19)

    Therefore, by virtue of Proposition 3.3, the fixed point x^* = 0 is globally asymptotically stable.

    Theorem 3.3. Consider discrete-time laser model (1.1), where A, B, C, H and initial value x_0 are positive fuzzy numbers, there exists positive number N_A , \forall \alpha\in(0, 1] , A_{r, \alpha} < N_A < 1 . If (3.14) holds true, and

    \begin{equation} B_{l, \alpha} \gt H_{l, \alpha}(1-A_{l, \alpha}), \ \ \ B_{r, \alpha} \gt H_{r, \alpha}(1-A_{r, \alpha}), \ \ \forall \alpha\in(0, 1], \end{equation} (3.20)

    then the following statements are true.

    (i) Every positive solution of (1.1) is bounded.

    (ii) Equation (1.1) has a unique positive fixed point x^* which is asymptotically stable.

    Proof. (i) Since A, B, C, H and x_0 are positive fuzzy numbers, there exist positive constants M_A, N_A, M_B, N_B, M_C, N_C, M_H, N_H, M_0, N_0 such that

    \begin{equation} \left\{ \begin{array}{l} [A]^\alpha = [A_{l, \alpha}, A_{r, \alpha}]\subset\overline{\bigcup_{\alpha\in(0, 1]}[A_{l, \alpha}, A_{r, \alpha}]}\subset[M_A, N_A]\\ \mbox{}\\ [B]^\alpha = [B_{l, \alpha}, B_{r, \alpha}]\subset\overline{\bigcup_{\alpha\in(0, 1]}[B_{l, \alpha}, B_{r, \alpha}]}\subset[M_B, N_B]\\ \mbox{}\\ [C]^\alpha = [C_{l, \alpha}, C_{r, \alpha}]\subset\overline{\bigcup_{\alpha\in(0, 1]}[C_{l, \alpha}, C_{r, \alpha}]}\subset[M_C, N_C]\\ \mbox{}\\ [H]^\alpha = [H_{l, \alpha}, H_{r, \alpha}]\subset\overline{\bigcup_{\alpha\in(0, 1]}[H_{l, \alpha}, H_{r, \alpha}]}\subset[M_H, N_H]\\ \mbox{}\\ [x_0]^\alpha = [L_{0, \alpha}, R_{0, \alpha}]\subset\overline{\bigcup_{\alpha\in(0, 1]}[L_{0, \alpha}, R_{0, \alpha}]}\subset[M_0, N_0] \end{array} \right. \end{equation} (3.21)

    Using (i) of Lemma 3.1, we can get that

    \begin{equation} 0 \lt L_n\le\frac{B_{l, \alpha}}{C_{l, \alpha}(1-A_{l, \alpha})}+L_{0, \alpha}, \ \ 0 \lt R_n\le\frac{B_{r, \alpha}}{C_{r, \alpha}(1-A_{r, \alpha})}+R_{0, \alpha}. \end{equation} (3.22)

    From (3.21) and (3.22), we have that for \alpha\in(0, 1]

    \begin{equation} [L_{n, \alpha}, R_{n, \alpha}]\subset [0, N], \ n\ge1. \end{equation} (3.23)

    where N = \frac{N_B}{M_C(1-N_A)}+N_0. From (3.22), we have for n\ge 1, \bigcup_{\alpha\in(0, 1]}[L_{n, \alpha}, R_{n, \alpha}]\subset (0, N] , so \overline{\bigcup_{\alpha\in(0, 1]}[L_{n, \alpha}, R_{n, \alpha}]}\subset (0, N]. Thus the proof of (i) is completed.

    (ii) We consider system (3.18), then the positive solution of (3.18) is given by

    \begin{equation} L_\alpha = \frac{B_{l, \alpha}}{C_{l, \alpha}(1-A_{l, \alpha})}-\frac{H_{l, \alpha}}{C_{l, \alpha}}, \ R_\alpha = \frac{B_{r, \alpha}}{C_{r, \alpha}(1-A_{r, \alpha})}-\frac{H_{r, \alpha}}{C_{r, \alpha}}, \alpha\in(0, 1]. \end{equation} (3.24)

    Let x_n be a positive solution of (1.1) such that [x_n]^\alpha = [L_{n, \alpha}, R_{n, \alpha}], \alpha\in(0, 1], n = 0, 1, 2, \cdots. Then applying Proposition 3.2 to system (3.16), we have

    \begin{equation} \lim\limits_{n\rightarrow\infty}L_{n, \alpha} = L_\alpha, \ \ \ \lim\limits_{n\rightarrow\infty}R_{n, \alpha} = R_\alpha \end{equation} (3.25)

    From (3.23) and (3.25), we have, for 0 < \alpha_1 < \alpha_2 < 1,

    \begin{equation} 0 \lt L_{\alpha_1}\le L_{\alpha_2}\le R_{\alpha_2}\le R_{\alpha_1}. \end{equation} (3.26)

    Since A_{l, \alpha}, A_{r, \alpha}, B_{l, \alpha}, B_{r, \alpha}, C_{l, \alpha}, C_{r, \alpha}, H_{l, \alpha}, H_{r, \alpha} are left continuous. It follows from (3.24) that L_\alpha, R_\alpha are also left continuous.

    From (3.21) and (3.24), it follows that

    \begin{equation} c = \frac{M_B}{N_C(1-M_A)}-\frac{N_H}{M_C}\le L_\alpha\le R_\alpha\le\frac{N_B}{M_A(1-N_A)}-\frac{M_H}{N_C} = d. \end{equation} (3.27)

    Therefore (3.27) implies that [L_\alpha, R_\alpha]\subset[c, d], and so \bigcup_{\alpha\in(0, 1]}[L_\alpha, R_\alpha]\subset[c, d]. It is clear that

    \begin{equation} \bigcup\limits_{\alpha\in(0, 1]}[L_\alpha, R_\alpha]\ \mbox{is}\ \ \mbox{compact} \ \mbox{and}\ \bigcup\limits_{\alpha\in(0, 1]}[L_\alpha, R_\alpha]\subset(0, \infty). \end{equation} (3.28)

    So from Definition 2.2, (3.24), (3.26), (3.28) and since L_\alpha, R_\alpha, \alpha\in(0, 1] determine a fuzzy number x^* such that

    \begin{equation} x^* = Ax^*+\frac{Bx^*}{Cx^*+H}, \ \ [x^*]^\alpha = [L_\alpha, R_\alpha], \ \alpha\in(0, 1]. \end{equation} (3.29)

    Suppose that there exists another positive fixed point \bar{x} of (1.1), then there exist functions \overline{L}_\alpha, \overline{R}_\alpha: (0, 1)\rightarrow(0, \infty) such that

    \bar{x} = A\bar{x}+\frac{B\bar{x}}{C\bar{x}+H}, \ \ [x]^\alpha = [\overline{L}_\alpha, \overline{R}_\alpha], \ \alpha\in(0, 1].

    From which we have

    \overline{L}_{\alpha} = A_{l, \alpha}\overline{L}_{\alpha}+\frac{B_{l, \alpha}\overline{L}_{\alpha}}{C_{l, \alpha}\overline{L}_{\alpha}+H_{l, \alpha}}, \ \ \overline{R}_{\alpha} = A_{r, \alpha}\overline{R}_{\alpha}+\frac{B_{r, \alpha}\overline{R}_{\alpha}}{C_{r, \alpha}\overline{R}_{\alpha}+H_{r, \alpha}}.

    So \overline{L}_\alpha = L_\alpha, \overline{R}_\alpha = R_\alpha, \alpha\in(0, 1] . Hence \bar{x} = x^* , namely x^* is a unique positive fixed point of (1.1).

    From (3.25), we have

    \begin{equation} \lim\limits_{n\rightarrow\infty}D(x_n, x^*) = \lim\limits_{n\rightarrow\infty}\sup\limits_{\alpha\in(0, 1]}\max\left\{|L_{n, \alpha}-L_\alpha|, |R_{n, \alpha}-R_\alpha|\right\} = 0. \end{equation} (3.30)

    Namely, every positive solution x_n of (1.1) converges the unique fixed point x^* with respect to D as n\rightarrow\infty. Applying Proposition 3.2, it can obtain that the positive fixed point x^* is globally asymptotically stable.

    Secondly, if Case II holds true, it follows that for n\in\{0, 1, 2, \cdots\}, \alpha\in(0, 1]

    \begin{equation} L_{n+1, \alpha} = A_{l, \alpha}L_{n, \alpha}+\frac{B_{r, \alpha}R_{n, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}, \ \ R_{n+1, \alpha} = = A_{r, \alpha}R_{n, \alpha}+\frac{B_{l, \alpha}L_{n, \alpha}}{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}} \end{equation} (3.31)

    We need the following lemma.

    Lemma 3.2. Consider the system of difference equations

    \begin{equation} y_{n+1} = a_1y_n+\frac{b_2z_n}{c_2z_{n}+h_2}, \ \ z_{n+1} = a_2z_n+\frac{b_1y_n}{c_1y_{n}+h_1}, \ \ n = 0, 1, \cdots, \end{equation} (3.32)

    where a_i\in(0, 1), b_i, c_i, h_i\in(0, +\infty) (i = 1, 2), y_0, z_0\in(0, +\infty) . If

    \begin{equation} a_1+a_2 \lt 1. \end{equation} (3.33)

    and

    \begin{equation} b_1b_2 \gt h_1h_2(1-a_1)(1-a_2). \end{equation} (3.34)

    Then the following statements are true.

    (i) Every positive solution (y_n, z_n) of (3.32) satisfy

    \begin{equation} 0 \lt y_n\le\frac{b_2}{(1-a_1)c_2}+y_0, \ \ \ 0 \lt z_n\le\frac{b_1}{(1-a_2)c_1}+z_0. \end{equation} (3.35)

    (ii) System (3.32) has fixed point (y, z) = (0, 0) which is asymptotically stable.

    (iii) System (3.32) has a unique fixed point

    \begin{equation} y = \frac{(1-a_2)K}{b_1c_2+h_2c_1(1-a_2)}, z = \frac{(1-a_1)K}{b_2c_1+h_1c_2(1-a_1)}, \end{equation} (3.36)

    where K = \frac{b_1b_2-h_1h_2(1-a_1)(1-a_2)}{(1-a_1)(1-a_2)}.

    Proof. (i) Let (y_n, z_n) be a positive solution of (3.32). It follows from (3.32) that, for n\ge 0 ,

    0 \lt y_{n+1} = a_1y_n+\frac{b_2z_n}{c_2z_n+h_2}\le a_1y_n+\frac{b_2}{c_2}, \ \ 0 \lt z_{n+1} = a_2z_n+\frac{b_1y_n}{c_1y_n+h_1}\le a_2z_n+\frac{b_1}{c_1}.

    From which, we have

    \left\{ \begin{array}{l} 0 \lt y_{n}\le\frac{b_2}{c_2(1-a_1)}+\left(y_0-\frac{b_2}{c_2(1-a_1)}\right)a_1^n\le\frac{b_2}{c_2(1-a_1)}+y_0\\ \mbox{}\\ 0 \lt z_{n}\le\frac{b_1}{c_1(1-a_2)}+\left(z_0-\frac{b_1}{c_1(1-a_2)}\right)a_2^n\le\frac{b_1}{c_1(1-a_2)}+z_0. \end{array} \right.

    This completes the proof of (i).

    (ii) It is clear that (0, 0) is a fixed point of (3.32). We can obtain that the linearized system of (3.32) about the fixed point (0, 0) is

    \begin{equation} X_{n+1} = D_1X_n, \end{equation} (3.37)

    where X_n = (x_n, y_n)^T and

    D_1 = \left( \begin{array}{cc} a_1 & \frac{b_2}{c_2}\\ \frac{b_1}{h_1} & a_2 \end{array} \right).

    Thus the characteristic equation of (3.37) is

    \begin{equation} \lambda^2-(a_1+a_2)\lambda+a_1a_2-\frac{b_1b_2}{h_1h_2} = 0. \end{equation} (3.38)

    Since (3.33) and (3.34) hold true, we have

    \begin{equation} a_1+a_2+a_1a_2-\frac{b_1b_2}{h_1h_2} \lt a_1+q_2+a_1a_2-(1-a_1)(1-a_2) \lt 1 \end{equation} (3.39)

    By virtue of Theorem 1.3.7 [28], we obtain that the fixed point (0, 0) is asymptotically stable.

    (iii) Let (y_n, z_n) = (y, z) be fixed point of (3.32). We consider the following system

    \begin{equation} y = a_1y+\frac{b_1z}{c_1z+h_1}, \ \ \ z = a_2z+\frac{b_2y}{c_2y+h_2}. \end{equation} (3.40)

    It is clear that the positive fixed point (y, z) can be written by (3.36).

    Theorem 3.4. Consider the difference Eq (1.1), where A, B, C, H are positive fuzzy numbers. There exists positive number N_A, \forall \alpha\in(0, 1], A_{r, \alpha} < N_A < 1. If

    \begin{equation} \frac{B_{l, \alpha}L_{n, \alpha}}{B_{r, \alpha}R_{n, \alpha}}\ge \frac{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}, \forall \alpha\in(0, 1], \end{equation} (3.41)
    \begin{equation} A_{l, \alpha}+A_{r, \alpha} \lt 1, \forall \alpha\in(0, 1], \end{equation} (3.42)

    and

    \begin{equation} B_{l, \alpha}B_{r, \alpha} \gt H_{l, \alpha}H_{r, \alpha}(1-A_{l, \alpha})(1-A_{r, \alpha}), \forall \alpha\in(0, 1]. \end{equation} (3.43)

    Then the following statements are true

    (i) Every positive solution of (1.1) is bounded.

    (ii) The Eq (1.1) has a fixed point 0 which is globally asymptotically stable.

    (iii) The Eq (1.1) has a unique positive fixed point x such that

    [x]^\alpha = [L_\alpha, R_\alpha], \ L_\alpha = \frac{(1-A_{r, \alpha})K_\alpha}{B_{l, \alpha}C_{r, \alpha}+H_{r, \alpha}C_{l, \alpha}(1-A_{r, \alpha})}, R_\alpha = \frac{(1-A_{l, \alpha})K_\alpha}{B_{r, \alpha}C_{l, \alpha}+H_{l, \alpha}C_{r, \alpha}(1-A_{l, \alpha})},

    where

    \begin{equation} K_\alpha = \frac{B_{l, \alpha}B_{r, \alpha}-H_{l, \alpha}H_{r, \alpha}(1-A_{l, \alpha})(1-A_{r, \alpha})}{(1-A_{l, \alpha})(1-A_{r, \alpha})}. \end{equation} (3.44)

    Proof. (i) Let x_n be a positive solution of (1.1). Applying (i) of Lemma 3.2, we have

    \begin{equation} 0 \lt L_n\le \frac{B_{r, \alpha}}{(1-A_{l, \alpha})C_{r, \alpha}}+L_{0, \alpha}, \ \ 0 \lt R_n\le \frac{B_{l, \alpha}}{(1-A_{r, \alpha})C_{l, \alpha}}+R_{0, \alpha}. \end{equation} (3.45)

    Next, the proof is similar to (i) of Theorem 3.3. So we omit it.

    (ii) The proof is similar to those of Theorem 3.2. We omit it.

    (iii) Let x_n = x be a fixed point of (1.1), then

    \begin{equation} x = Ax+\frac{Bx}{Cx+H}. \end{equation} (3.46)

    Taking \alpha -cuts on both sides of (3.46), since (3.41) holds true, one gets the following system

    \begin{equation} L_\alpha = A_{l, \alpha}L_\alpha+\frac{B_{r, \alpha}R_\alpha}{C_{r, \alpha}R_\alpha+H_{r, \alpha}}, \ \ R_\alpha = A_{r, \alpha}R_\alpha+\frac{B_{l, \alpha}L_\alpha}{C_{l, \alpha}L_\alpha+H_{l, \alpha}}, \ \ \alpha\in(0, 1]. \end{equation} (3.47)

    From which we obtain that

    \begin{equation} L_\alpha = \frac{(1-A_{r, \alpha})K_\alpha}{B_{l, \alpha}C_{r, \alpha}+H_{r, \alpha}C_{l, \alpha}(1-A_{r, \alpha})}, R_\alpha = \frac{(1-A_{l, \alpha})K_\alpha}{B_{r, \alpha}C_{l, \alpha}+H_{l, \alpha}C_{r, \alpha}(1-A_{l, \alpha})}, \end{equation} (3.48)

    Next, we can show that L_\alpha, R_\alpha constitute a positive fuzzy number x such that [x]^\alpha = [L_\alpha, R_\alpha], \alpha\in(0, 1]. The proof is similar to (ii) of Theorem 3.3. We omit it.

    Remark 3.1. In dynamical system model, the parameters of model derived from statistic data with vagueness or uncertainty. It corresponds to reality to use fuzzy parameters in dynamical system model. Compared with classic discrete time laser model, the solution of discrete time fuzzy laser model is within a range of value (approximate value), which are taken into account fuzzy uncertainties. Furthermore the global asymptotic behaviour of discrete time laser model are obtained in fuzzy context. The results obtained is generation of discrete time Beverton-Holt population model with fuzzy environment [25].

    In this section, we give two numerical examples to verify the effectiveness of theoretic results obtained.

    Example 4.1. Consider the following fuzzy discrete time laser model

    \begin{equation} x_{n+1} = Ax_n+\frac{Bx_n}{Cx_{n}+H}, \ n = 0, 1, \cdots, \end{equation} (4.1)

    we take A, B, C, H and the initial values x_0 such that

    \begin{equation} \begin{array}{ll} A(x) = \left\{ \begin{array}{ll} 10x-4, & 0.4\le x\le 0.5\\ \mbox{}&\mbox{}\\ -10x+6, & 0.5\le x\le 0.6 \end{array} \right., & B(x) = \left\{ \begin{array}{ll} 5x-4, & 0.8\le x\le 1\\ \mbox{}&\mbox{}\\ -5x+6, & 1\le x\le 1.2 \end{array} \right. \end{array} \end{equation} (4.2)
    \begin{equation} \begin{array}{ll} C(x) = \left\{ \begin{array}{ll} 2x-2, & 1\le x\le 1.5\\ \mbox{}&\mbox{}\\ -2x+4, & 1.5\le x\le 2 \end{array} \right., & H(x) = \left\{ \begin{array}{ll} 2x-6, & 3\le x\le 3.5\\ \mbox{}&\mbox{}\\ -2x+8, & 3.5\le x\le 4 \end{array} \right. \end{array} \end{equation} (4.3)
    \begin{equation} x_0(x) = \left\{ \begin{array}{ll} x-6, & 6\le x\le 7\\ \mbox{}&\mbox{}\\ -x+8, &7\le x\le 8 \end{array} \right. \end{equation} (4.4)

    From (4.2), we get

    \begin{equation} [A]^\alpha = \left[0.4+\frac{1}{10}\alpha, 0.6-\frac{1}{10}\alpha\right], \ [B]^\alpha = \left[0.8+\frac{1}{5}\alpha, 1.2-\frac{1}{5}\alpha\right], \ \alpha\in(0, 1]. \end{equation} (4.5)

    From (4.3) and (4.4), we get

    \begin{equation} [C]^\alpha = \left[1+\frac{1}{2}\alpha, 2-\frac{1}{2}\alpha\right], \ \ [H]^\alpha = \left[3+\frac{1}{2}\alpha, 4-\frac{1}{2}\alpha\right], [x_0]^\alpha = \left[6+\alpha, 8-\alpha\right], \ \alpha\in(0, 1]. \end{equation} (4.6)

    Therefore, it follows that

    \begin{equation} \overline{\bigcup\limits_{\alpha\in(0, 1]}[A]^\alpha} = [0.4, 0.6], \ \overline{\bigcup\limits_{\alpha\in(0, 1]}[B]^\alpha} = [0.8, 1.2], \ \overline{\bigcup\limits_{\alpha\in(0, 1]}[C]^\alpha} = [1, 2], \overline{\bigcup\limits_{\alpha\in(0, 1]}[H]^\alpha} = [3, 4]. \overline{\bigcup\limits_{\alpha\in(0, 1]}[x_0]^\alpha} = [6, 8]. \end{equation} (4.7)

    From (4.1), it results in a coupled system of difference equations with parameter \alpha,

    \begin{equation} L_{n+1, \alpha} = A_{l, \alpha}L_{n, \alpha}+\frac{B_{l, \alpha}L_{n, \alpha}}{C_{l, \alpha}L_{n, \alpha}+H_{l, \alpha}}, \ \ R_{n+1, \alpha} = A_{r, \alpha}R_{n, \alpha}+\frac{B_{r, \alpha}R_{n, \alpha}}{C_{r, \alpha}R_{n, \alpha}+H_{r, \alpha}}, \ \alpha\in(0, 1]. \end{equation} (4.8)

    Therefore, it is clear that A_{r, \alpha} < 1, \forall\alpha\in(0, 1], (3.14) and (3.15) hold true. so from Theorem 3.2, we have that every positive solution x_n of Eq (4.1) is bounded In addition, from Theorem 3.2, Eq (4.1) has a fixed point 0 . Moreover every positive solution x_n of Eq (4.1) converges the fixed point 0 with respect to D as n\rightarrow \infty. (see Figures 13).

    Figure 1.  The Dynamics of system (4.8).
    Figure 2.  The solution of system (4.8) at \alpha = 0 and \alpha = 0.25 .
    Figure 3.  The solution of system (4.8) at \alpha = 0.75 and \alpha = 1 .

    Example 4.2. Consider the following fuzzy discrete time laser model (4.1). where A, C, H and the initial values x_0 are same as Example 4.1.

    \begin{equation} B(x) = \left\{ \begin{array}{ll} x-2, & 2\le x\le 3\\ \mbox{}&\mbox{}\\ -x+4, & 3\le x\le 4 \end{array} \right. \end{equation} (4.9)

    From (4.9), we get

    \begin{equation} [B]^\alpha = \left[2+\alpha, 4-\alpha\right], \end{equation} (4.10)

    Therefore, it follows that

    \begin{equation} \overline{\bigcup\limits_{\alpha\in(0, 1]}[B]^\alpha} = [2, 4], \alpha\in(0, 1]. \end{equation} (4.11)

    It is clear that (3.20) is satisfied, so from Theorem 3.3, Eq (4.1) has a unique positive equilibrium \overline{x} = (0.341, 1.667, 3) . Moreover every positive solution x_n of Eq (4.1) converges the unique equilibrium \overline{x} with respect to D as n\rightarrow \infty. (see Figures 46)

    Figure 4.  The Dynamics of system (4.8).
    Figure 5.  The solution of system (4.8) at \alpha = 0 and \alpha = 0.25 .
    Figure 6.  The solution of system (4.8) at \alpha = 0.75 and \alpha = 1 .

    In this work, according to a generalization of division (g-division) of fuzzy number, we study the fuzzy discrete time laser model x_{n+1} = Ax_n+\frac{Bx_{n}}{Cx_{n}+H} . The existence of positive solution and qualitative behavior to (1.1) are investigated. The main results are as follows

    (i) Under Case I, the positive solution is bounded if B_{l, \alpha} < H_{l, \alpha}(1-A_{l, \alpha}), B_{r, \alpha} < H_{r, \alpha}(1-A_{r, \alpha}), \alpha\in(0, 1] . Moreover system (1.1) has a fixed point 0 which is globally asymptotically stable. Otherwise, if B_{l, \alpha}\ge H_{l, \alpha}(1-A_{l, \alpha}), B_{r, \alpha}\ge H_{r, \alpha}(1-A_{r, \alpha}), \alpha\in(0, 1] . Then system (1.1) has a unique positive fixed point x^* which is asymptotically stable.

    (ii) Under Case II, if A_{l, \alpha}+A_{r, \alpha} < 1 and B_{l, \alpha}B_{r, \alpha} > H_{l, \alpha}H_{r, \alpha}(1-A_{l, \alpha})(1-A_{r, \alpha}), \alpha\in(0, 1] , then the positive solution is bounded. Moreover system (1.1) has a unique positive fixed point x and fixed point 0 which is global asymptotically stable.

    The authors would like to thank the Editor and the anonymous Reviewers for their helpful comments and valuable suggestions to improve the paper. The work is partially supported by National Natural Science Foundation of China (11761018), Scientific Research Foundation of Guizhou Provincial Department of Science and Technology([2020]1Y008, [2019]1051), Priority Projects of Science Foundation at Guizhou University of Finance and Economics (2018XZD02), and Scientific Climbing Programme of Xiamen University of Technology(XPDKQ20021).

    The authors declare that they have no competing interests.

    [1] Castro AA, Caetano MS, Silva TC, et al. (2016) Molecular docking, metal substitution and hydrolysis reaction of chiral substrates of phosphotriesterase. Comb Chem High Throughput Screen 19: 334–344.
    [2] Calvert GM, Karnik J, Mehler L, et al. (2008) Acute pesticide poisoning among agricultural workers in the United States, 1998–2005. Am J Ind Med 51: 883–898.
    [3] Berny P (2007) Pesticides and the intoxication of wild animals. J Vet Pharmacol Ther 30: 93–100.
    [4] Lima WEA, Pereira AF, Castro AA, et al. (2016) Flexibility in the molecular design of Acetylcholinesterase Reactivators: Probing Representative Conformations by Chemometric Techniques and Docking/QM Calculations. Lett Drug Des Discov 13: 360–371.
    [5] Sartorelli J, Castro AA, Ramalho TC, et al. (2016) Asymmetric biocatalysis of the nerve agent VX by human serum paraoxonase 1: molecular docking and reaction mechanism calculations. Med Chem Res 25: 2521–2533.
    [6] King, AM, Aaron CK (2015) Organophosphate and carbamate poisoning. Emerg Med Clin North Am 33: 133–151.
    [7] Ramalho TC, Castro AA, Silva DR, et al. (2016) Computational enzymology and organophosphorus degrading enzymes: Promising approaches toward remediation technologies of warfare agents and pesticides. Curr Med Chem 23: 1041–1061.
    [8] Iyer R, Iken B, Damania A (2013) A comparison of organophosphate degradation genes and bioremediation applications. Environ Microbiol Rep 5: 787–798.
    [9] Iyer R, Iken B (2015) Protein engineering of representative hydrolytic enzymes for remediation of organophosphates. Biochem Eng J 94: 134–144.
    [10] Kuca K, Bartosova L, Jun D, et al. (2005) New quaternary pyridine aldoximes as casual antidotes against nerve agents intoxications. Biomed Pap Med Fac Univ Palacky Olomouc Czech Repub 149: 75–82.
    [11] Nemukhin AV, Grigorenko BL, Lushchekina SV, et al. (2012) Quantum chemical modelling in the research of molecular mechanisms of enzymatic catalysis. Russ Chem Rev 81: 1011–1025.
    [12] van der Kamp MW, Mulholland AJ (2008) Computational enzymology: insight into biological catalysts from modelling. Nat Prod Rep 25: 1001–1014.
    [13] Puri KD, Di Paolo JA, Gold MR (2013) B-cell receptor signaling inhibitors for treatment of autoimmune inflammatory diseases and B-cell malignancies. Int Rev Immunol 32: 397–427.
    [14] Chen YC (2015) Beware of docking! Trends Pharmacol Sci 36: 78–95.
    [15] Thomsen R, Christensen MH (2006) MolDock: a new technique for high-accuracy molecular docking. J Med Chem 49: 3315–3321.
    [16] Jones G, Willett P, Glen RC, et al. (1997) Development and validation of a genetic algorithm for flexible docking. J Mol Biol 267: 727–748.
    [17] Goodsell DS, Olson AJ (1990) Automated docking of substrates to proteins by simulated annealing. Proteins Struct Funct Bioinforma 8: 195–202.
    [18] Morris GM, Goodsell DS, Olson AJ (1996) Automated docking of flexible ligands: applications of AutoDock. J Comput Aided Mol Des 10: 293–304.
    [19] Rarey M, Kramer B, Lengauer T, et al. (1996) A fast flexible docking method using an incremental construction algorithm. J Mol Biol 261: 470–489.
    [20] Azevedo LS, Moraes FP, Xavier MM, et al. (2012) Recent progress of molecular docking simulations applied to development of drugs. Curr Bioinform 7: 352–365.
    [21] Liu M, Wang S (1999) MCDOCK: a Monte Carlo simulation approach to the molecular docking problem. J Comput Aided Mol Des 13: 435–451.
    [22] Rosenfeld RJ, Goodsell DS, Musah RA, et al. (2003) Automated docking of ligands to an arti cial active site: augmenting crystallographic analysis with computer modeling. J Comput Aided Mol Des 17: 525–536.
    [23] da Cunha EFF, Ramalho TC, Reynolds RC (2008) Binding mode analysis of 2,4-diamino-5-methyl-5-deaza-6-substituted pteridines with Mycobacterium tuberculosis and human dihydrofolate reductases. J Biomol Struct Dyn 25: 377–385.
    [24] Assis LC, Santos-Garcia L, Ramalho TC, et al. (2013) Interactions of pyrimidine derivatives with dihydrofolate reductase and thymidylate synthase: directions toward combating toxoplasmosis. Curr Bioact Compd 9: 153–166.
    [25] Kuntz ID, Blaney JM, Oatley SJ, et al. (1982) A geometric approach to macromolecule-ligand interactions. J Mol Biol 161: 269–288.
    [26] Kirkpatrick S, Gelatt Jr CD, Vecchi MP (1983) Optimization by simmulated annealing. Science 220: 671–680.
    [27] Assis TM, Mancini DT, Ramalho TC, et al. (2014) In silico study of Leishmania donovani α-β tubulin and inhibitors. J Chem 2014: 1–8.
    [28] Giacoppo JOS, Mancini DT, Guimaraes AP, et al. (2015) Molecular modeling toward selective inhibitors of dihydrofolate reductase from the biological warfare agent Bacillus anthracis. Eur J Med Chem 91: 63–71.
    [29] Mulholland AJ (2007) Chemical accuracy in QM/MM calculations on enzyme-catalysed reactions. Chem Cent J 1: 1–5.
    [30] Santos-Garcia L, Assis LC, Silva DR, et al. (2016) QSAR analysis of nicotinamidic compounds and design of potential Bruton's tyrosine kinase (Btk) inhibitors. J Biomol Struct Dyn 34: 1421–1440.
    [31] Namba AM, Silva VB, Silva CHTP (2008) Dinâmica molecular: teoria e aplicações em planejamento de fármacos. Ecl Quim 33: 13–23.
    [32] Fattebert JL, Lau EY, Bennion BJ, et al. (2015) Large-scale first-principles molecular dynamics simulations with electrostatic embedding: application to acetylcholinesterase catalysis. J Chem Theory Comput 11: 5688–5695.
    [33] de Azevedo WF (2011) Molecular dynamics simulations of protein targets identified in Mycobacterium tuberculosis. Curr Med Chem 18: 1353–1366.
    [34] Weiner PK, Kollman PA (1981) AMBER: Assisted model building with energy refinement. A general program for modeling molecules and their interactions. J Comput Chem 2: 287–303.
    [35] Brooks BR, Bruccoleri RE, Olafson BD, et al. (1983) CHARMM: A program for macromolecular energy, minimization, and dynamics calculations. J Comput Chem 4: 187–217.
    [36] Kalé L, Skeel R, Bhandarkar M, et al. (1999) NAMD2: greater scalability for parallel molecular dynamics. J Comput Phys 151: 283–312.
    [37] Phillips JC, Braun R, Wang W, et al. (2005) Scalable molecular dynamics with NAMD. J Comput Chem 26: 1781–1802.
    [38] Scott WRP, Hünenberger PH, Tironi IG, et al. (1999) The GROMOS biomolecular simulation program package. J Phys Chem A 103: 3596–3607.
    [39] Dubey KD, Tiwari RK, Ojha RP (2013) Recent advances in protein-ligand interactions: molecular dynamics simulations and binding free energy. Curr Comput Aided-Drug Des 9: 518–531.
    [40] Durrant JD, McCammon JA (2011) Molecular dynamics simulations and drug discovery. BMC Biol 9: 1–9.
    [41] Karplus M, McCammon JA (2002) Molecular dynamics simulations of biomolecules. Nat Struct Biol 9: 646–652.
    [42] Ochoa R, Rodriguez CA, Zuluaga AF (2016) Perspectives for the structure-based design of acetylcholinesterase reactivators. J Mol Graph Model 68: 176–183.
    [43] Zheng M, Waller MP (2016) Adaptive quantum mechanics/molecular mechanics methods. Wiley Interdiscip Rev Comput Mol Sci 6: 369–385.
    [44] Ryde, U (2016) QM/MM calculations on proteins, In: Voth GA, Methods in enzymology: computational approaches for studying enzyme mechanism Part A, 1 Ed., Elsevier Inc., 119–158.
    [45] Lodola A, Mulholland AJ (2013) Computational enzymology. Methods Mol Biol 924: 67–89.
    [46] Senn HM, Thiel W (2009) QM/MM methods for biomolecular systems. Angew Chem Int Ed Engl 48: 1198–1229.
    [47] van der Kamp MW, Mulholland AJ (2013) Combined quantum mechanics/molecular mechanics (QM/MM) methods in computational enzymology. Biochemistry 52: 2708–2728.
    [48] Silva MC, Torres JA, Castro AA, et al. (2015) Combined experimental and theoretical study on the removal of pollutant compounds by peroxidases: affinity and reactivity toward a bioremediation catalyst. J Biomol Struct Dyn 34: 1–35.
    [49] Silva TC, Pires MS, Castro AA, et al. (2015) Molecular insight into the inhibition mechanism of plant and rat 4-hydroxyphenylpyruvate dioxygenase by molecular docking and DFT calculations. Med Chem Res 24: 3958–3971.
    [50] Balali-Mood M, Abdollahi M (2014) Basic and clinical toxicology of organophosphorus compounds, 1 Ed., London: Springer International Publishing.
    [51] Kumar DN, Alex SA, Chandrasekaran N, et al. (2016) Acetylcholinesterase (AChE)-mediated immobilization of silver nanoparticles for the detection of organophosphorus pesticides. RSC Adv 6: 64769–64777.
    [52] Jang YJ, Kim K, Tsay O, et al. (2015) Update 1 of: destruction and detection of chemical warfare agents. Chem Rev 115: PR1–PR76.
    [53] Kim K, Tsay OG, Atwood DA, et al. (2011) Destruction and detection of chemical warfare agents. Chem Rev 111: 5345–5403.
    [54] Roberts JR, Reigart JR (2013) Recognition and management of pesticide poisoning, 6 Eds., Washington: United States Environmental Protection Agency Office of Pesticide Programs.
    [55] Cavalcanti LPAN, Aguiar AP, Lima JA, Lima ALS (2016) Organophosphorous poisoning: treatment and analytical methodologies applied in evaluation of reactivation and inhibition of acetylcholinesterase. Rev Virtual Química 8: 739–766.
    [56] Giacoppo JOS, França TCC, Kuča K, et al. (2014) Molecular modeling and in vitro reactivation study between the oxime BI-6 and acetylcholinesterase inhibited by different nerve agents. J Biomol Struct Dyn 33: 2048–2058.
    [57] Dvir H, Silman I, Harel M, et al. (2010) Acetylcholinesterase: from 3D structure to function. Chem Biol Interact 187: 10–22.
    [58] Patočka J, Cabal J, Kuča, K, et al. (2005) Oxime reactivation of acetylcholinesterase inhibited by toxic phosphorus esters: In vitro kinetics and thermodynamics. J Appl Biomed 3: 91–99.
    [59] Tafuri J, Roberts J (1987) Organophosphate poisoning. Ann Emerg Med 16: 193–202.
    [60] Mileson B (1998) Common mechanism of toxicity: a case study of organophosphorus pesticides. Toxicol Sci 41: 8–20.
    [61] Eddleston M (2004) Self poisoning with pesticides. BMJ 328: 42–44.
    [62] Delfino RT, Ribeiro TS, Figueroa-Villar JD (2009) Organophosphorus compounds as chemical warfare agents: A review. J Braz Chem Soc 20: 407–428.
    [63] Hörnberg A, Tunemalm AK, Ekström F (2007) Crystal structures of acetylcholinesterase in complex with organophosphorus compounds suggest that the acyl pocket modulates the aging reaction by precluding the formation of the trigonal bipyramidal transition state. Biochemistry 46: 4815–4825.
    [64] DuBois, KP (1971) The toxicity of organophosphorus compounds to mammals. Bull World Health Organ 44: 231–240.
    [65] Pasquet J, Mazuret A, Fournel J, et al. (1976) Acute oral and percutaneous toxicity of phosalone in the rat, in comparison with azinphosmethyl and Parathion. Toxicol Appl Pharm 37: 85–92.
    [66] Jamal GA, Hansen S, Julu PO (2002) Low level exposures to organophosphorus esters may cause neurotoxicity. Toxicology 182: 23–33.
    [67] Brunton LL, Chabner BA, Knollmann BC (2010) The Pharmacological Basis of Therapeutics.
    [68] Kavalci C, Durukan P, Ozer M, et al. (2009) Organophosphate poisoning due to a wheat bagel. Intern Med 48: 85–88.
    [69] Mercey G, Verdelet T, Renou J, et al. (2012) Reactivators of acetylcholinesterase inhibited by organophosphorus nerve agents. Acc Chem Res 45: 756–766.
    [70] Wilson IB, Ginsburg S (1955) A powerful reactivator of alkylphosphate-inhibited acetylcholinesterase. Biochim Biophys Acta 18: 168–170.
    [71] Soares S, Vieira AA, Delfino RT, et al. (2013) NMR determination of Electrophorus electricus acetylcholinesterase inhibition and reactivation by neutral oximes. Bioorg Med Chem 21: 5923–5930.
    [72] Kuca K, Jun D, Musilek K (2006) Structural requirements of acetylcholinesterase reactivators. Mini-Reviews Med Chem 6: 269–277.
    [73] Musilek K, Dolezal M, Gunn-Moore F, et al. (2011) Design, evaluation and structure-activity relationship studies of the AChE reactivators against organophosphorus pesticides. Med Res Rev 31: 548–575.
    [74] Husain K (2013) Delayed neurotoxicity of organophosphorus compounds. J Enviromental Immunol Toxicol 1: 14–21.
    [75] Sahu AK, Sharma R, Gupta B, et al. (2016) Oxime-mediated in vitro reactivation kinetic analysis of organophosphates-inhibited human and electric eel acetylcholinesterase. Toxicol Mech Methods 6516: 1–8.
    [76] Szinicz L (2005) History of chemical and biological warfare agents. Toxicology 214: 167–181.
    [77] Singh BK, Walker A (2006) Microbial degradation of organophosphorus compounds. FEMS Microbiol Rev 30: 428–471.
    [78] Omburo GA, Kuo JM, Mullins LS, et al. (1992) Characterization of the zinc-binding site of bacterial phosphotriesterase. J Biol Chem 267: 13278–13283.
    [79] Perezgasga L, Sanchez-Sanchez L, Aguila S, et al. (2012) Substitution of the catalytic metal and protein PEGylation enhances activity and stability of bacterial phosphotriesterase. Appl Biochem Biotechnol 166: 1236–1247.
    [80] Tsai PC, Fox N, Bigley AN, et al. (2012) Enzymes for the homeland defense: optimizing phosphotriesterase for the hydrolysis of organophosphate nerve agents. Biochemistry 51: 6463–6475.
    [81] Singh BK (2009) Organophosphorus-degrading bacteria: ecology and industrial applications. Nat Rev Microbiol 7: 156–164.
    [82] Theriot CM, Grunden AM (2011) Hydrolysis of organophosphorus compounds by microbial enzymes. Appl Microbiol Biotechnol 89: 35–43.
    [83] Bigley AN, Raushel FM (2013) Catalytic mechanisms for phosphotriesterases. Biochim Biophys Acta 1834: 443–453.
    [84] Rochu D, Viguié N, Renault F, et al. (2004) Contribution of the active-site metal cation to the catalytic activity and to the conformational stability of phosphotriesterase: temperature- and pH-dependence. Biochem J 380: 627–633.
    [85] Chen SL, Fang WH, Himo F (2008) Technical aspects of quantum chemical modeling of enzymatic reactions: the case of phosphotriesterase. Theor Chem Acc 120: 515–522.
    [86] Vanhooke JL, Benning MM, Raushel FM, et al. (1996) Three-dimensional structure of the zinc-containing phosphotriesterase with the bound substrate analog diethyl 4-methylbenzylphosphonate. Biochemistry 35: 6020–6025.
    [87] Lotti M (2002) Promotion of organophosphate induced delayed polyneuropathy by certain esterase inhibitors. Toxicology 181: 245–248.
    [88] Chen-Goodspeed M, Sogorb MA, Wu F, et al. (2001) Structural determinants of the substrate and stereochemical specificity of phosphotriesterase. Biochemistry 40: 1325–1331.
    [89] Chen-Goodspeed M, Sogorb MA, Wu F, et al. Enhancement, relaxation, and reversal of the stereoselectivity for phosphotriesterase by rational evolution of active site residues. Biochemistry 40: 1332–1339.
    [90] Nowlan C, Li Y, Hermann JC, et al. (2006) Resolution of chiral phosphate, phosphonate, and phosphinate esters by an enantioselective enzyme library. J Am Chem Soc 128: 15892–15902.
    [91] Hong SB, Raushel FM (1999) Stereochemical preferences for chiral substrates by the bacterial phosphotriesterase. Chem Biol Interact 119: 225–234.
    [92] Tsai PC, Bigley A, Li Y, et al. (2010) Stereoselective hydrolysis of organophosphate nerve agents by the bacterial phosphotriesterase. Biochemistry 49: 7978–7987.
    [93] Lewis VE, Donarski WJ, Wild JR, et al. (1988) Mechanism and stereochemical course at phosphorus of the reaction catalyzed by a bacterial phosphotriesterase. Biochemistry 27: 1591–1597.
    [94] Aubert SD, Li YC, Raushel FM (2004) Mechanism for the hydrolysis of organophosphates by the bacterial phosphotriesterase. Biochemistry 43: 5707–5715.
    [95] Bigley AN, Xu C, Henderson TJ, et al. (2013) Enzymatic neutralization of the chemical warfare agent VX: evolution of phosphotriesterase for phosphorothiolate hydrolysis. J Am Chem Soc 135: 10426–10432.
    [96] Nachon F, Brazzolotto X, Trovaslet M, et al. (2013) Progress in the development of enzyme-based nerve agent bioscavengers. Chem Biol Interact 206: 536–544.
    [97] Furlong CE (2008) Paraoxonases: An historical perspective, In: Mackness B, Mackness M, Aviram M, et al., The paraoxonases: their role in disease development and xenobiotic metabolism, Springer, 3–31.
    [98] Aharoni A, Gaidukov L, Khersonsky O, et al. (2005) The 'evolvability' of promiscuous protein functions. Nat Genet 37: 73–76.
    [99] Khersonsky O, Tawfik DS (2006) The histidine 115-histidine 134 dyad mediates the lactonase activity of mammalian serum paraoxonases. J Biol Chem 281: 7649–7656.
    [100] Cannard K (2006) The acute treatment of nerve agent exposure. J Neurol Sci 249: 86–94.
    [101] Gaidukov L, Tawfik DS (2007) The development of human sera tests for HDL-bound serum PON1 and its lipolactonase activity. J Lipid Res 48: 1637–1646.
    [102] Yeung DT, Lenz DE, Cerasoli DM (2008) Human paraoxonase I: A potential bioscavenger of organophosphorus nerve agents, In: Mackness B, Mackness M, Aviram M, et al., The paraoxonases: their role in disease development and xenobiotic metabolism, Springer, 151–170.
    [103] Lenz DE, Yeung D, Smith JR, et al. (2007) Stoichiometric and catalytic scavengers as protection against nerve agent toxicity: A mini review. Toxicology 233: 31–39.
    [104] Rochu D, Chabriere E, Masson P (2007) Human paraoxonase: A promising approach for pre-treatment and therapy of organophosphorus poisoning. Toxicology 233: 47–59.
    [105] La Du BN, Aviram M, Billecke S, et al. (1999) On the physiological role(s) of the paraoxonases. Chem Biol Interact 119: 379–388.
    [106] Ahmed Z, Ravandi A, Maguire GF, et al. (2002) Multiple substrates for paraoxonase-1 during oxidation of phosphatidylcholine by peroxynitrite. Biochem Biophys Res Commun 290: 391–396.
    [107] Shih DM, Gu LJ, Xia YR, et al. (1998) Mice lacking serum paraoxonase are susceptible to organophosphate toxicity and atherosclerosis. Nature 394: 284–287.
    [108] Mackness B, Mackness M (2010) Anti-inflammatory properties of paraoxonase-1 in atherosclerosis, In: Reddy ST, Paraoxonases in inflammation, infection, and toxicology, Humana Press, 143–151.
    [109] Koren-Gluzer M, Aviram M, Meilin E, et al. (2011) The antioxidant HDL-associated paraoxonase-1 (PON1) attenuates diabetes development and stimulates beta-cell insulin release. Atherosclerosis 219: 510–518.
    [110] Li WF, Furlong CE, Costa LG (1995) Paraoxonase protects against chlorpyrifos toxicity in mice. Toxicol Lett 76: 219–226.
    [111] Camps J, Pujol I, Ballester F, et al. (2011) Paraoxonases as potential antibiofilm agents: their relationship with quorum-sensing signals in gram-negative bacteria. Antimicrob Agents Chemother 55: 1325–1331.
    [112] Yeung DT, Lenz DE, Cerasoli DM (2005) Analysis of active-site amino-acid residues of human serum paraoxonase using competitive substrates. FEBS J 272: 2225–2230.
    [113] Harel M, Aharoni A, Gaidukov L, et al. (2004) Structure and evolution of the serum paraoxonase family of detoxifying and anti-atherosclerotic enzymes. Nat Struct Mol Biol 11: 412–419.
    [114] Fairchild SZ, Peterson MW, Hamza A, et al. (2011) Computational characterization of how the VX nerve agent binds human serum paraoxonase 1. J Mol Model 17: 97–109.
    [115] Kuo CL, La Du BN (1998) Calcium binding by human and rabbit serum paraoxonases-structural stability and enzymatic activity. Drug Metab Dispos 26: 653–660.
    [116] Blum MM, Timperley CM, Williams GR, et al. (2008) Inhibitory potency against human acetylcholinesterase and enzymatic hydrolysis of Fluorogenic nerve agent mimics by human paraoxonase 1 and squid diisopropyl fluorophosphatase. Biochemistry 47: 5216–5224.
    [117] Hu X, Jiang X, Lenz DE, et al. (2009) In silico analyses of substrate interactions with human serum paraoxonase 1. Proteins 75: 486–498.
    [118] Otto TC, Harsch CK, Yeung DT, et al. (2009) Dramatic differences in organophosphorus hydrolase activity between human and chimeric recombinant mammalian paraoxonase-1 enzymes. Biochemistry 48: 10416–10422.
    [119] Sanan TT, Muthukrishnan S, Beck JM, et al. (2010) Computational modeling of human paraoxonase 1: preparation of protein models, binding studies, and mechanistic insights. J Phys Org Chem 23: 357–369.
    [120] Dumas DP, Caldwell SR, Wild JR, et al. (1989) Purification and properties of the phosphotriesterase from Pseudomonas diminuta. J Biol Chem 264: 19659–19665.
    [121] Muthukrishnan S, Shete VS, Sanan TT, et al. (2012) Mechanistic insights into the hydrolysis of organophosphorus compounds by paraoxonase-1: exploring the limits of substrate tolerance in a promiscuous enzyme. J Phys Org Chem 25: 1247–1260.
    [122] Wymore T, Field MJ, Langan P, et al. (2014) Hydrolysis of DFP and the nerve agent (S)-sarin by DFPase proceeds along two different reaction pathways: Implications for engineering bioscavengers. J Phys Chem B 118: 4479–4489.
    [123] Chen JCH, Mustyakimov M, Schoenborn BP, et al. (2010) Neutron structure and mechanistic studies of diisopropyl fluorophosphatase (DFPase). Acta Crystallogr D 66: 1131–1138.
    [124] Katsemi V, Lücke C, Koepke J, et al. (2005) Mutational and structural studies of the diisopropylfluorophosphatase from Loligo vulgaris shed new light on the catalytic mechanism of the enzyme. Biochemistry 44: 9022–9033.
    [125] Elias M, Liebschner D, Koepke J, et al. (2013) Hydrogen atoms in protein structures: high-resolution X-ray diffraction structure of the DFPase. BMC Res Notes 6: 1–7.
    [126] Hoskin FCG, Rosenberg P, Brzin M (1966) Re-examination of the effect of DFP on electrical and cholinesterase activity of squid giant axon. Proc Natl Acad Sci USA 55: 1231–1235.
    [127] Hoskin FCG, Long RJ (1972) Purification of a DFP-hydrolyzing enzyme from squid head ganglion. Arch Biochem Biophys 150: 548–555.
    [128] Gay DD, Hoskin FCG (1979) Stereospecificity and active site requirements in a diisopropylphosphorofluoridate-hydrolyzing enzyme. Biochem Pharmacol 28: 1259–1261.
    [129] Hoskin FCG, Kirkish MA, Steinmann KE (1984) Two enzymes for the detoxication of organophosphorus compounds-sources, similarities, and significance. Fundam Appl Toxicol 4: 165–172.
    [130] Hartleib J, Rüterjans H (2001) Insights into the reaction mechanism of the diisopropyl fluorophosphatase from Loligo vulgaris by means of kinetic studies, chemical modification and site-directed mutagenesis. Biochim Biophys Acta 1546: 312–324.
    [131] Hartleib J, Geschwindner S, Scharff EI, et al. (2001) Role of calcium ions in the structure and function of the di-isopropylfluorophosphatase from Loligo vulgaris. Biochem J 353: 579–589.
    [132] Hartleib J, Rüterjans H (2001) High-yield expression, purification, and characterization of the recombinant diisopropylfluorophosphatase from Loligo vulgaris. Protein Expr Purif 21: 210–219.
    [133] Scharff EI, Koepke J, Fritzsch G, et al. (2001) Crystal structure of diisopropylfluorophosphatase from Loligo vulgaris. Structure 9: 493–502.
    [134] Blum MM, Löhr F, Richardt A, et al. (2006) Binding of a designed substrate analogue to diisopropyl fluorophosphatase: Implications for the phosphotriesterase mechanism. J Am Chem Soc 128: 12750–12757.
    [135] Melzer M, Chen JCH, Heidenreich A, et al. (2009) Reversed enantioselectivity of diisopropyl fluorophosphatase against organophosphorus nerve agents by rational design. J Am Chem Soc 131: 17226–17232.
    [136] Koepke J, Scharff EI, Lücke C, et al. (2003) Statistical analysis of crystallographic data obtained from squid ganglion DFPase at 0.85 A resolution. Acta Crystallogr D 59: 1744–1754.
  • This article has been cited by:

    1. Ali Zia, Abdelwahed Khamis, James Nichols, Usman Bashir Tayab, Zeeshan Hayder, Vivien Rolland, Eric Stone, Lars Petersson, Topological deep learning: a review of an emerging paradigm, 2024, 57, 1573-7462, 10.1007/s10462-024-10710-9
    2. Zisheng Ouyang, Zhen Chen, Xuewei Zhou, Zhongzhe Ouyang, Imported risk in global financial markets: Evidence from cross-market connectedness, 2025, 10629408, 102374, 10.1016/j.najef.2025.102374
    3. Yue Liu, Lichang Zhang, Pierre Failler, Zirui Wang, The Dynamic Evolution of Agricultural Trade Network Structures and Its Influencing Factors: Evidence from Global Soybean Trade, 2025, 13, 2079-8954, 279, 10.3390/systems13040279
    4. Mohosin Islam Palash, Samia Rahman Misty, Mohammad Shafiul Alam, 2024, Automated Recognition of Harmonic Patterns in Candlestick Chart: A Comparative Study of Machine Learning and Deep Learning Approaches, 979-8-3315-1909-4, 551, 10.1109/ICCIT64611.2024.11022580
  • Reader Comments
  • © 2017 the Author(s), licensee AIMS Press. This is an open access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0)
通讯作者: 陈斌, bchen63@163.com
  • 1. 

    沈阳化工大学材料科学与工程学院 沈阳 110142

  1. 本站搜索
  2. 百度学术搜索
  3. 万方数据库搜索
  4. CNKI搜索

Metrics

Article views(7687) PDF downloads(1038) Cited by(10)

Figures and Tables

Figures(10)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog