curcumin (cur) is the active curcuminoid with many physiological, biochemical, and pharmacological properties. solubility and stability of cur is the limiting factors for realizing its therapeutic potential. bovine β-casein is an abundant milk protein that is highly amphiphilic and self-assembles into stable micellar nanoparticles in aqueous solution. β-casein nanoparticle can solubilize cur mo...

the melanocortin-1 receptor mc1r is encoded by the extension locus, playing a fundamental role in the determination of coat color in a number of mammalian species. however, so far there has been no report regarding the single nucleotide polymorphisms (snps) of the mc1r promoter region and the potential association of its snps with coat color in sheep (ovis aries). throughout the present study, ...

The interaction between [Pt(phen)(pyrr-dtc)]NO3 (where phen = 1,10-phenanthroline and pyrr-dtc =pyrrolidinedithiocarbamat) with human serum albumin (HSA) was studied by fluorescence, UV–vis absorption, circular dichroism (CD) spectroscopy and molecular docking technique under like physiological condition in Tris–HCl buffer solution at pH 7.4. UV-Vis absorption spectroscopy indicates that the pro...

By employing the theoretical method based on tight-binding, we study electronic band structure of single-wall carbon nanotube (CNT) superlattices, which the system is the made of the junction between the zigzag and armchair carbon nanotubes. Exactly at the place of connection, it is appeared the pentagon–heptagon pairs as topological defect in carbon hexagonal network. The calculations are base...

A molecule called transcription factor usually binds to a set of promoter sequences of coexpressed genes. As a result, these promoter sequences contain some short substrings, or binding sites, with similar patterns. The motif discovering problem is to find these similar patterns and motifs in a set of sequences. Most existing algorithms find the motifs based on strong-signal sequences only (i.e...

We consider the binding numbers of Kr-free graphs, and improve upper bounds on the binding number which force a graph to contain a clique of order r. For the case r = 4, we provide a construction for K4-free graphs which have a larger binding number than previously known constructions. This leads to a counterexample to a conjecture by Caro regarding the neighborhoods of independent sets.

The number of objects that can be maintained in visual working memory without interference is limited. We present simulations of a model of visual working memory in ventral prefrontal cortex that has this constraint as well. One layer in ventral PFC represents all objects in memory. These representations are used to bind the features of the objects. If there are too many objects, their represen...

The binding number of a graphG is defined to be the minimum of |N(S)|/|S| taken over all nonempty S ⊆ V (G) such that N(S) 6= V (G). In this paper another look is taken at the basic properties of the binding number. Several bounds are established, including ones linking the binding number of a tree to the “distribution” of its end-vertices. Further, it is established that under some simple cond...