Loading [MathJax]/jax/output/SVG/jax.js
Research article

Thermodynamic, kinetic and docking studies of some unsaturated fatty acids-quercetin derivatives as inhibitors of mushroom tyrosinase

  • Received: 03 June 2020 Accepted: 01 September 2020 Published: 25 September 2020
  • Inhibition of activity and stability structure of mushroom tyrosinase (MT) is highly important, since it is a key enzyme of melanogenesis playing various roles in organisms. In this study, thermodynamic stability and diphenolase activities were investigated in the presence of quercetin-7-linoleate (ligand I) and quercetin-7-oleate (ligand II) on mushroom tyrosinase by experimental and computational methods. Kinetic analyses showed that the inhibition mechanism of these ligands is reversible and competitive manner. The inhibition constants values (KiI = 0.31 and KiII = 0.43 mM) and the half maximal inhibitory concentration (IC50 = 0.58 and 0.71 mM) were determined for ligand I and ligand II respectively. Thermal denaturation for the sole and modified enzyme were performed by using fluorescence spectroscopy to obtain the thermodynamic parameters of denaturation. Type of interactions and orientation of ligands were determined by molecular docking simulations. The binding affinities of the MT–ligand complexes during docking were calculated. In the computational studies performed using the MT (PDBID: 2Y9X) from which tropolone was removed, we showed that the ligands occupied different pockets in MT other than the active site. The best binding energies with values of −9 and −7.9 kcal/mol were calculated and the MolDock scores of the best poses with the lowest root mean square deviation (RMSD) were obtained as −172.70 and −165.75 kcal/mol for complexes of MT–ligand I and MT–ligand II, respectively. Computational simulations and experimental analysis demonstrated that the ligands increased the mushroom tyrosinase stability by reducing the activity of enzyme. In this regard, ligand I showed the potent inhibitory and played an important role in enzyme stability.

    Citation: Morteza Vaezi, G. Rezaei Behbehani, Nematollah Gheibi, Alireza Farasat. Thermodynamic, kinetic and docking studies of some unsaturated fatty acids-quercetin derivatives as inhibitors of mushroom tyrosinase[J]. AIMS Biophysics, 2020, 7(4): 393-410. doi: 10.3934/biophy.2020027

    Related Papers:

    [1] Abel Cabrera Martínez, Iztok Peterin, Ismael G. Yero . Roman domination in direct product graphs and rooted product graphs. AIMS Mathematics, 2021, 6(10): 11084-11096. doi: 10.3934/math.2021643
    [2] Fu-Tao Hu, Xing Wei Wang, Ning Li . Characterization of trees with Roman bondage number 1. AIMS Mathematics, 2020, 5(6): 6183-6188. doi: 10.3934/math.2020397
    [3] Rangel Hernández-Ortiz, Luis Pedro Montejano, Juan Alberto Rodríguez-Velázquez . Weak Roman domination in rooted product graphs. AIMS Mathematics, 2021, 6(4): 3641-3653. doi: 10.3934/math.2021217
    [4] Mingyu Zhang, Junxia Zhang . On Roman balanced domination of graphs. AIMS Mathematics, 2024, 9(12): 36001-36011. doi: 10.3934/math.20241707
    [5] Jian Yang, Yuefen Chen, Zhiqiang Li . Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1. AIMS Mathematics, 2023, 8(8): 17702-17718. doi: 10.3934/math.2023904
    [6] Saeed Kosari, Yongsheng Rao, Zehui Shao, Jafar Amjadi, Rana Khoeilar . Complexity of signed total $k$-Roman domination problem in graphs. AIMS Mathematics, 2021, 6(1): 952-961. doi: 10.3934/math.2021057
    [7] Zhibin Du, Ayu Ameliatul Shahilah Ahmad Jamri, Roslan Hasni, Doost Ali Mojdeh . Maximal first Zagreb index of trees with given Roman domination number. AIMS Mathematics, 2022, 7(7): 11801-11812. doi: 10.3934/math.2022658
    [8] Bana Al Subaiei, Ahlam AlMulhim, Abolape Deborah Akwu . Vertex-edge perfect Roman domination number. AIMS Mathematics, 2023, 8(9): 21472-21483. doi: 10.3934/math.20231094
    [9] Chang-Xu Zhang, Fu-Tao Hu, Shu-Cheng Yang . On the (total) Roman domination in Latin square graphs. AIMS Mathematics, 2024, 9(1): 594-606. doi: 10.3934/math.2024031
    [10] Abel Cabrera-Martínez, Andrea Conchado Peiró . On the $ \{2\} $-domination number of graphs. AIMS Mathematics, 2022, 7(6): 10731-10743. doi: 10.3934/math.2022599
  • Inhibition of activity and stability structure of mushroom tyrosinase (MT) is highly important, since it is a key enzyme of melanogenesis playing various roles in organisms. In this study, thermodynamic stability and diphenolase activities were investigated in the presence of quercetin-7-linoleate (ligand I) and quercetin-7-oleate (ligand II) on mushroom tyrosinase by experimental and computational methods. Kinetic analyses showed that the inhibition mechanism of these ligands is reversible and competitive manner. The inhibition constants values (KiI = 0.31 and KiII = 0.43 mM) and the half maximal inhibitory concentration (IC50 = 0.58 and 0.71 mM) were determined for ligand I and ligand II respectively. Thermal denaturation for the sole and modified enzyme were performed by using fluorescence spectroscopy to obtain the thermodynamic parameters of denaturation. Type of interactions and orientation of ligands were determined by molecular docking simulations. The binding affinities of the MT–ligand complexes during docking were calculated. In the computational studies performed using the MT (PDBID: 2Y9X) from which tropolone was removed, we showed that the ligands occupied different pockets in MT other than the active site. The best binding energies with values of −9 and −7.9 kcal/mol were calculated and the MolDock scores of the best poses with the lowest root mean square deviation (RMSD) were obtained as −172.70 and −165.75 kcal/mol for complexes of MT–ligand I and MT–ligand II, respectively. Computational simulations and experimental analysis demonstrated that the ligands increased the mushroom tyrosinase stability by reducing the activity of enzyme. In this regard, ligand I showed the potent inhibitory and played an important role in enzyme stability.


    In this paper, we shall only consider graphs without multiple edges or loops. Let G=(V(G),E(G)) be a graph, vV(G), the neighborhood of v in G is denoted by N(v). That is to say N(v)={u|uvE(G),uV(G)}. The degree of a vertex v is denoted by d(v), i.e. d(v)=|N(v)|. A graph is trivial if it has a single vertex. The maximum degree and the minimum degree of a graph G are denoted by Δ(G) and δ(G), respectively. Denote by Kn the complete graph on n vertices.

    A subset D of the vertex set of a graph G is a dominating set if every vertex not in D has at least one neighbor in D. The domination number γ(G) is the minimum cardinality of a dominating set of G. A dominating set D of G with |D|=γ(G) is called a γ-set of G.

    Roman domination of graphs is an interesting variety of domination, which was proposed by Cockayne et al. [6]. A Roman dominating function (RDF) of a graph G is a function f:V(G){0,1,2} such that every vertex u for which f(u)=0 is adjacent to at least one vertex v for which f(v)=2. The weight w(f) of a Roman dominating function f is the value w(f)=uV(G)f(u). The minimum weight of an RDF on a graph G is called the Roman domination number γR(G) of G. An RDF f of G with w(f)=γR(G) is called a γR-function of G. The problems on domination and Roman domination of graphs have been investigated widely, for example, see list of references [8,9,10,13] and [3,7,12], respectively.

    In 2016, Chellali et al. [5] introduced a variant of Roman dominating functions, called Roman {2}-dominating functions. A Roman {2}-dominating function (R{2}DF) of G is a function f:V{0,1,2} such that uN(v)f(u)2 for every vertex vV with f(v)=0. The weight of a Roman {2}-dominating function f is the sum vVf(v). The Roman {2}-domination number γ{R2}(G) is the minimum weight of an R{2}DF of G. Note that if f is an R{2}DF of G and v is a vertex with f(v)=0, then either there is a vertex uN(v) with f(u)=2, or at least two vertices x,yN(v) with f(x)=f(y)=1. Hence, an R{2}DF of G is also an RDF of G, which is also mentioned by Chellali et al [5]. Moreover, they showed that the decision problem for Roman {2}-domination is NP-complete, even for bipartite graphs.

    In fact, a Roman {2}-dominating function is essentially the same as a weak {2}-dominating function, which was introduced by Brešar et al. [1] and studied in literatures [2,11,14,15].

    For a mapping f:V(G){0,1,2}, let (V0,V1,V2) be the ordered partition of V(G) induced by f such that Vi={x:f(x)=i} for i=0,1,2. Note that there exists a 1-1 correspondence between the function f and the partition (V0,V1,V2) of V(G), so we will write f=(V0,V1,V2).

    Chellali et al. [4] obtained the following lower bound of Roman domination number.

    Lemma 1. (Chellali et al. [4]) Let G be a nontrivial connected graph with maximum degree Δ. Then γR(G)Δ+1Δγ(G).

    In this paper, we generalize this result on nontrivial connected graph G with maximum degree Δ and minimum degree δ. We prove that γR(G)Δ+2δΔ+δγ(G). As a corollary, we obtain that 32γ(G)γR(G)2γ(G) for any nontrivial regular graph G. Moreover, we prove that γR(G)2γ{R2}(G)1 for every graph G and there exists a graph Ik such that γ{R2}(Ik)=k and γR(Ik)=2k1 for any integer k2.

    Lemma 2. (Cockayne et al. [6]) Let f=(V0,V1,V2) be a γR-function of an isolate-free graph G with |V1| as small as possible. Then

    (i) No edge of G joins V1 and V2;

    (ii) V1 is independent, namely no edge of G joins two vertices in V1;

    (iii) Each vertex of V0 is adjacent to at most one vertex of V1.

    Theorem 3. Let G be a nontrivial connected graph with maximum degree Δ(G)=Δ and minimum degree δ(G)=δ. Then

    γR(G)Δ+2δΔ+δγ(G). (2.1)

    Moreover, if the equality holds, then

    γ(G)=n(Δ+δ)Δδ+Δ+δandγR(G)=n(Δ+2δ)Δδ+Δ+δ.

    Proof. Let f=(V0,V1,V2) be a γR-function of G with V1 as small as possible. By Lemma 2, we know that N(v)V0 for any vV1 and N(v1)N(v2)= for any v1,v2V1. So we have

    |V1||V0|δ (2.2)

    Since G is nontrivial, it follows that V2. Note that every vertex in V2 is adjacent to at most Δ vertices in V0; we have

    |V0|Δ|V2| (2.3)

    By Formulae (2.2) and (2.3), we have

    |V1|Δδ|V2| (2.4)

    By the definition of an RDF, every vertex in V0 has at least one neighbor in V2. So V1V2 is a dominating set of G. Together with Formula (2.4), we can obtain that

    γ(G)|V1|+|V2|Δδ|V2|+|V2|=Δ+δδ|V2|.

    Note that f is a γR-function of G; we have

    γR(G)=|V1|+2|V2|=(|V1|+|V2|)+|V2|γ(G)+δΔ+δγ(G)=Δ+2δΔ+δγ(G).

    Moreover, if the equality in Formula (2.1) holds, then by previous argument we obtain that |V1|=|V0|δ, |V0|=Δ|V2|, and V1V2 is a γ-set of G. Then we have

    n=|V0|+|V1|+|V2|=|V0|+|V0|δ+|V0|Δ=Δδ+Δ+δΔδ|V0|.

    Hence, we have

    |V0|=nΔδΔδ+Δ+δ,|V1|=nΔΔδ+Δ+δ, and |V2|=nδΔδ+Δ+δ.

    So

    γR(G)=|V1|+2|V2|=n(Δ+2δ)Δδ+Δ+δ and γ(G)=|V1|+|V2|=n(Δ+δ)Δδ+Δ+δ

    since V1V2 is a γ-set of G. This completes the proof.

    Now we show that the lower bound in Theorem 3 can be attained by constructing an infinite family of graphs. For any integers k2, δ2 and Δ=kδ, we construct a graph Hk from K1,Δ by adding k news vertices such that each new vertex is adjacent to δ vertices of K1,Δ with degree 1 and no two new vertices has common neighbors. Then add some edges between the neighbors of each new vertex u such that δ(Hk)=δ and the induced subetaaph of N(u) in Hk is not complete. The resulting graph Hk is a connected graph with maximum degree Δ(G)=Δ and maximum degree δ(G)=δ. It can be checked that γ(Hk)=k+1 and γR(Hk)=k+2=Δ+2δΔ+δγ(G).

    For example, if k=2, δ=3 and Δ=kδ=6, then the graph H2 constructed by the above method is shown in Figure 1, where u1 and u2 are new vertices.

    Figure 1.  An example to illustrate the construction of Hk.

    Furthermore, by Theorem 3, we can obtain a lower bound of the Roman domination number on regular graphs.

    Corollary 4. Let G be an r-regular graph, where r1. Then

    γR(G)32γ(G) (2.5)

    Moreover, if the equality holds, then

    γ(G)=2nr+2andγR(G)=3nr+2.

    Proof. Since G is r-regular, we have Δ(G)=δ(G)=r. By Theorem 3 we can obtain that this corollary is true.

    For any integer n2, denote by G2n the (2n2)-regular graph with 2n vertices, namely G2n is the graph obtained from K2n by deleting a perfect matching. It can be checked that γ(G2n)=2 and γR(G2n)=3=32γ(G) for any n2. Hence, the bound in Corollary 4 is attained.

    Note that γR(G)2γ(G) for any graph G; we can conclude the following result.

    Corollary 5. Let G be an r-regular graph, where r1. Then

    32γ(G)γR(G)2γ(G).

    Chellali et al. [5] obtain the following bounds for the Roman {2}-domination number of a graph G.

    Lemma 6. (Chellali et al. [5]) For every graph G, γ(G)γ{R2}(G)γR(G)2γ(G).

    Lemma 7. (Chellali et al. [5]) If G is a connected graph of order n and maximum degree Δ(G)=Δ, then

    γ{R2}(G)2nΔ+2.

    Theorem 8. For every graph G, γR(G)2γ{R2}(G)1. Moreover, for any integer k2, there exists a graph Ik such that γ{R2}(Ik)=k and γR(Ik)=2k1.

    Proof. Let f=(V0,V1,V2) be an γ{R2}-function of G. Then γ{R2}(G)=|V1|+2|V2| and γR(G)2|V1|+2|V2| since V1V2 is a dominating set of G. If |V2|1, then γR(G)2|V1|+2|V2|=2γ{R2}(G)2|V2|2γ{R2}(G)2. If |V2|=0, then every vertex in V0 is adjacent to at least two vertices in V1. So for any vertex uV1, f=(V0,{u},V1{u}) is an RDF of G. Then we have γR(G)1+2|V1{u}|=2|V1|1=2γ{R2}(G)1.

    For any integer k2, let Ik be the graph obtained from Kk by replacing every edge of Kk with two paths of length 2. Then Δ(Ik)=2(k1) and δ(Ik)=2. We first prove that γ{R2}(Ik)=k. Since V(Ik)=|V(Kk)|+2|E(Kk)|=k+2k(k1)2=k2, by Lemma 7 we can obtain γ{R2}(Ik)2|V(Ik)|Δ(Ik)+2=2k22(k1)+2=k. On the other hand, let f(x)=1 for each xV(Ik) with d(x)=2(k1) and f(y)=0 for each yV(Ik) with d(y)=2. It can be seen that f is an R{2}DF of Ik and w(f)=k. Hence, γ{R2}(Ik)=k.

    We now prove that γR(Ik)=2k1. Let g={V1,V2,V3} be a γR-function of Ik such that |V1| is minimum. For each 4-cycle C=v1v2v3v4v1 of Ik with d(v1)=d(v3)=2(k1) and d(v2)=d(v4)=2, we have wg(C)=g(v1)+g(v2)+g(v3)+g(v4)2. If wg(C)=2, then by Lemma 2(iii) we have g(vi){0,2} for any i{1,2,3,4}. Hence, one of v1 and v3 has value 2 and g(v2)=g(v4)=0. If wg(C)=3, then by Lemma 2(i) we have {g(v1),g(v3)}={1,2} or {g(v2),g(v4)}={1,2}. When {g(v2),g(v4)}={1,2}, let {g(v1),g(v2)}={1,2}, g(v2)=g(v4)=0 and g(x)=g(x) for any xV(Ik){v1,v2,v3,v4}. Then g is also a γR-function of Ik. If wg(C)=4, then exchange the values on C such that v1,v3 have value 2 and v2,v4 have value 0. So we obtain that Ik has a γR-function h such that h(y)=0 for any yV(Ik) with degree 2. Note that any two vertices of Ik with degree 2(k1) belongs to a 4-cycle considered above; we can obtain that there is exactly one vertex z of Ik with degree 2(k1) such that h(z)=1. Hence, γR(Ik)=w(h)=2k1.

    Note that the graph Ik constructed in Theorem 8 satisfies that γ(Ik)=k=γ{R2}(Ik). By Theorem 8, it suffices to prove that γ(Ik)=k. Let A={v:vV(Ik),d(v)=2(k1)} and B=V(Ik)A. We will prove that Ik has a γ-set containing no vertex of B. Let D be a γ-set of Ik. If D contains a vertex uB. Since the degree of u is 2, let u1 and u2 be two neighbors of u in Ik. Then d(u1)=d(u2)=2(k1) and, by the construction of Ik, u1 and u2 have two common neighbors u,u with degree 2. Hence, at least one of u,u1, and u2 belongs to D. Let D=(D{u,u}){u1,u2}. Then D is also a γ-set of Ik. Hence, we can obtain a γ-set of Ik containing no vertex of B by performing the above operation for each vertex vDB. So A is a γ-set of Ik and γ(Ik)=|A|=k.

    By Lemma 6 and Theorem 8, we can obtain the following corollary.

    Corollary 9. For every graph G, γ{R2}(G)γR(G)2γ{R2}(G)1.

    Theorem 10. For every graph G, γR(G)γ(G)+γ{R2}(G)1.

    Proof. By Lemma 6 we can obtain that γR(G)2γ(G)γ(G)+γ{R2}(G). If the equality holds, then γR(G)=2γ(G) and γ(G)=γ{R2}(G). So γR(G)=2γ{R2}(G), which contradicts Theorem 8. Hence, we have γR(G)γ(G)+γ{R2}(G)1.

    In this paper, we prove that γR(G)Δ+2δΔ+δγ(G) for any nontrivial connected graph G with maximum degree Δ and minimum degree δ, which improves a result obtained by Chellali et al. [4]. As a corollary, we obtain that 32γ(G)γR(G)2γ(G) for any nontrivial regular graph G. Moreover, we prove that γR(G)2γ{R2}(G)1 for every graph G and the bound is achieved. Although the bounds in Theorem 3 and Theorem 8 are achieved, characterizing the graphs that satisfy the equalities remain a challenge for further work.

    The author thanks anonymous referees sincerely for their helpful suggestions to improve this work. This work was supported by the National Natural Science Foundation of China (No.61802158) and Natural Science Foundation of Gansu Province (20JR10RA605).

    The author declares that they have no conflict of interest.


    Acknowledgments



    Imam Khomeini International University (Qazvin), Cellular and Molecular Research Center, Qazvin University of Medical Sciences are gratefully acknowledged.

    Conflict of interest



    The authors declare no conflict of interest.

    [1] Lind T, Siegbahn PEM, Crabtree RH (1999) A quantum chemical study of the mechanism of tyrosine. J Phys Chem B 103: 1193-1202.
    [2] Nokinsee D, Shank L, Lee VS, et al. (2015) Estimation of inhibitory effect against tyrosinase activity through homology modeling and molecular docking. Enzyme Res .
    [3] Ismaya WT, Rozeboom HJ, Weijn A, et al. (2011) Crystal structure of Agaricus bisporus mushroom tyrosinase: identity of the tetramer subunits and interaction with tropolone. Biochemistry 50: 5477-5486.
    [4] Matoba Y, Kihara S, Bando N, et al. (2018) Catalytic mechanism of the tyrosinase reaction toward the Tyr98 residue in the caddie protein. PLoS Biol 16: e3000077.
    [5] Murray AF (2016)  Tyrosinase Inhibitors Identified from Phytochemicals and Their Mechanism of Control Berkeley.
    [6] Gou L, Lee J, Hao H, et al. (2017) The effect of oxaloacetic acid on tyrosinase activity and structure: Integration of inhibition kinetics with docking simulation. Int J Biol Macromol 101: 59-66.
    [7] Chang TS (2009) An updated review of tyrosinase inhibitors. Int J Mol Sci 10: 2440-2475.
    [8] Kim YJ, Uyama H (2005) Tyrosinase inhibitors from natural and synthetic sources: structure, inhibition mechanism and perspective for the future. Cell Mol Life Sci 62: 1707-1723.
    [9] Rho HS, Ahn SM, Lee BC, et al. (2010) Changes in flavonoid content and tyrosine inhibitory activity in kenaf leaf extract after far-infrared treatment. Bioorg Med Chem Lett 20: 7534-7536.
    [10] Da Hae G, Jo JM, Kim SY, et al. (2019) Tyrosinase inhibitors from natural source as skin-whitening agents and the application of edible insects: A mini review. Inter J Clin Nutr Diet 5.
    [11] Chang TS (2009) An updated review of tyrosinase inhibitors. J Molecul Sci 10: 2440-2475.
    [12] Glatz JFC, Börchers T, Spener F, et al. (1995) Fatty acids in cell signalling: modulation by lipid binding proteins. Prostag, Leukotr Ess 52: 121-127.
    [13] Mainini F, Contini A, Nava D, et al. (2013) Synthesis, molecular characterization and preliminary antioxidant activity evaluation of quercetin fatty esters. J Am Oil Chemists' Soc 90: 1751-1759.
    [14] Simopoulos AP (2002) Omega-3 fatty acids in inflammation and autoimmune diseases. J Am Coll Nutr 21: 495-505.
    [15] Johnson M, Bradford C (2014) Omega-3, omega-6 and omega-9 fatty acids: implications for cardiovascular and other diseases. J Glycomics Lipidomics 4: 2153-0637.
    [16] Ando H, Wen ZM, Kim HY, et al. (2006) Intracellular composition of fatty acid affects the processing and function of tyrosinase through the ubiquitin–proteasome pathway. Biochem J 394: 43-50.
    [17] Richards LB, Li M, van Esch BCAM, et al. (2016) The effects of short-chain fatty acids on the cardiovascular system. Pharma Nutrition 4: 68-111.
    [18] Khan F, Niaz K, Maqbool F, et al. (2016) Molecular targets underlying the anticancer effects of quercetin: an update. Nutrients 8: 529.
    [19] Warnakulasuriya SN, Rupasinghe HP (2014) Long chain fatty acid acylated derivatives of quercetin-3-O-glucoside as antioxidants to prevent lipid oxidation. Biomolecules 4: 980-993.
    [20] Jamali Z, Rezaei Behbehani G, Zare K, et al. (2019) Effect of chrysin omega-3 and 6 fatty acid esters on mushroom tyrosinase activity, stability, and structure. J Food Biochem 43: e12728.
    [21] Ashraf Z, Rafiq M, Seo SY, et al. (2015) Synthesis, kinetic mechanism and docking studies of vanillin derivatives as inhibitors of mushroom tyrosinase. Bioorgan Med Chem 23: 5870-5880.
    [22] Hassani S, Haghbeen K, Fazli M (2016) Non-specific binding sites help to explain mixed inhibition in mushroom tyrosinase activities. EurJ Med Chem 122: 138-148.
    [23] Li ZC, Chen LH, Yu XJ, et al. (2010) Inhibition kinetics of chlorobenzaldehyde thiosemicarbazones on mushroom tyrosinase. J Agr Food Chem 58: 12537-12540.
    [24] Trott O, Olson AJ (2010) AutoDock Vina: improving the speed and accuracy of docking with a new scoring function, efficient optimization, and multithreading. J Comput Chem 31: 455-461.
    [25] Matoba Y, Kihara S, Bando N, et al. (2018) Catalytic mechanism of the tyrosinase reaction toward the Tyr98 residue in the caddie protein. PLoS Biol 16: e3000077.
    [26] Studio A D (2006)  1.7 San Diego, CA, USA: Accelrys Software Inc..
    [27] Mazhab-Jafari MT, Marshall CB, Smith MJ, et al. (2015) Oncogenic and RASopathy-associated K-RAS mutations relieve membrane-dependent occlusion of the effector-binding site. P Natl Acad Sci 112: 6625-6630.
    [28] Kusumaningrum S, Budianto E, Kosela S, et al. (2014) The molecular docking of 1, 4-naphthoquinone derivatives as inhibitors of Polo-like kinase 1 using Molegro Virtual Docker. J App Sci 4: 47-53.
    [29] Thomsen R, Christensen MH (2006) MolDock: a new technique for high-accuracy molecular docking. J Med Chem 49: 3315-3321.
    [30] Batra J Biophysical studies of protein folding and binding stability (2009) .
    [31] Gheibi N, Saboury AA, Haghbeen K, et al. (2009) Dual effects of aliphatic carboxylic acids on cresolase and catecholase reactions of mushroom tyrosinase. J Enzym Inhib Med Chem 24: 1076-1081.
    [32] Gheibi N, Zavareh SH, Behbahani GRR, et al. App Bioch Microbiol (2016) .52: 304-310.
    [33] Jamkhande PG, Ghante MH, Ajgunde BR (2017) Software based approaches for drug designing and development: a systematic review on commonly used software and its applications. Bulletin of Faculty of Pharmacy, Cairo University 55: 203-210.
    [34] Guo YJ, Pan ZZ, Chen CQ, et al. (2010) Inhibitory effects of fatty acids on the activity of mushroom tyrosinase. Appl Biochem Biotech 162: 1564-1573.
    [35] Lestari SR, Lukiati B, Arifah SN, et al. (2019)  Medicinal uses of single garlic in hyperlipidemia by fatty acid synthase enzyme inhibitory: Molecular docking, IOP Conference Series: Earth and Environmental Science IOP Publishing, 012008.
    [36] Monserud JH, Schwartz DK (2012) Effects of molecular size and surface hydrophobicity on oligonucleotide interfacial dynamics. Biomacromolecules 13: 4002-4011.
    [37] Shalbafan M, Behbehani GR, Divsalar A (2018) The effect of methotrexate on the structural changes of human serum. J Ponte 74: 60-67.
    [38] Xue YL, Miyakawa T, Hayashi Y (2011) Isolation and tyrosinase inhibitory effects of polyphenols from the leaves of persimmon, Diospyros kaki. J Agr Food Chem 59: 6011-6017.
    [39] McDonnell JR, Reynolds RG, Fogel DB Docking conformationally flexible small molecules into a protein binding site through evolutionary programming (1995) .
    [40] Thomsen R, Christensen MH (2006) MolDock: A new technique for high-accuracy molecular docking. J Med Chem 49: 3315-3321.
    [41] Baek HS, Rho HS, Yoo JW, et al. (2008) The inhibitory effect of new hydroxamic acid derivatives on melanogenesis. B Korean Chem Soc 29: 43-46.
    [42] Kim YJ, Kang KS, Yokozawa T (2008) The anti-melanogenic effect of pycnogenol by its anti-oxidative actions. Food Chem Toxicol 46: 2466-2471.
    [43] Panich U, Pluemsamran T, Wattanarangsan J, et al. (2013) Protective effect of AVS073, a polyherbal formula, against UVA-induced melanogenesis through a redox mechanism involving glutathione-related antioxidant defense. BMC Complem Altern M 13: 1-10.
  • This article has been cited by:

    1. Chang-Xu Zhang, Fu-Tao Hu, Shu-Cheng Yang, On the (total) Roman domination in Latin square graphs, 2024, 9, 2473-6988, 594, 10.3934/math.2024031
    2. Sakander Hayat, Raman Sundareswaran, Marayanagaraj Shanmugapriya, Asad Khan, Venkatasubramanian Swaminathan, Mohamed Hussian Jabarullah, Mohammed J. F. Alenazi, Characterizations of Minimal Dominating Sets in γ-Endowed and Symmetric γ-Endowed Graphs with Applications to Structure-Property Modeling, 2024, 16, 2073-8994, 663, 10.3390/sym16060663
    3. Tatjana Zec, On the Roman domination problem of some Johnson graphs, 2023, 37, 0354-5180, 2067, 10.2298/FIL2307067Z
    4. Jian Yang, Yuefen Chen, Zhiqiang Li, Some sufficient conditions for a tree to have its weak Roman domination number be equal to its domination number plus 1, 2023, 8, 2473-6988, 17702, 10.3934/math.2023904
  • Reader Comments
  • © 2020 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(6656) PDF downloads(303) Cited by(9)

/

DownLoad:  Full-Size Img  PowerPoint
Return
Return

Catalog