Search results for "combinatorial"
showing 10 items of 1208 documents
Applications and Limitations of Dendrimers in Biomedicine
2020
Biomedicine represents one of the main study areas for dendrimers, which have proven to be valuable both in diagnostics and therapy, due to their capacity for improving solubility, absorption, bioavailability and targeted distribution. Molecular cytotoxicity constitutes a limiting characteristic, especially for cationic and higher-generation dendrimers. Antineoplastic research of dendrimers has been widely developed, and several types of poly(amidoamine) and poly(propylene imine) dendrimer complexes with doxorubicin, paclitaxel, imatinib, sunitinib, cisplatin, melphalan and methotrexate have shown an improvement in comparison with the drug molecule alone. The anti-inflammatory therapy focus…
Direct synthesis of C3-mono-functionalized oxindoles from N-unprotected 2-oxindole and their antileishmanial activity.
2014
A novel approach for the synthesis of unprecedented C3-mono-functionalized indolin-2-ones is reported, starting from 2-oxindole and chalcones. The reactions proceed regioselectively under mild conditions, without di- and tri-alkylated side products. The new compounds have been evaluated in vitro for their antiproliferative effects against the protozoan Leishmania infantum. Interestingly, they appear able to kill L. infantum promastigotes and amastigotes, without significant cytotoxic effects.
Atom- and Bond-Based 2D TOMOCOMD-CARDD Approach and Ligand-Based Virtual Screening for the Drug Discovery of New Tyrosinase Inhibitors
2008
Two-dimensional atom- and bond-based TOMOCOMD-CARDD descriptors and linear discriminant analysis (LDA) are used in this report to perform a quantitative structure-activity relationship (QSAR) study of tyrosinase-inhibitory activity. A database of inhibitors of the enzyme is collected for this study, within 246 highly dissimilar molecules presenting antityrosinase activity. In total, 7 discriminant functions are obtained by using the whole set of atom- and bond-based 2D indices. All the LDA-based QSAR models show accuracies above 90% in the training set and values of the Matthews correlation coefficient (C) varying from 0.85 to 0.90. The external validation set shows globally good classifica…
Catalytic Enantioselective Addition of Me2Zn to Isatins
2017
Chiral α-hydroxyamide L5 derived from (S)-(+)-mandelic acid catalyzes the enantioselective addition of dimethylzinc to isatins affording the corresponding chiral 3-hydroxy-3-methyl-2-oxindoles with good yields and er up to 90:10. Furthermore, several chemical transformations were performed with the 3-hydroxy-2-oxindoles obtained.
Transport of dipeptides and phosphono dipeptides through an immobilized liquid membrane. Stereoselectivity of the process
1993
Abstract Dipeptide and phosphono dipeptide hydrochlorides permeated well through a 1-decanol membrane supported in a porous polyethylene hollow fiber matrix. This transfer is easily accomplished either by passive or by carrier-facilitated (with Kryptofixes 222 or 5 present in the membrane phase) transport. The transport is stereoselective with l-l dipeptides being transported faster than their l-d isomers.
On the subset sum problem for finite fields
2021
Abstract Let G be the additive group of a finite field. J. Li and D. Wan determined the exact number of solutions of the subset sum problem over G, by giving an explicit formula for the number of subsets of G of prescribed size whose elements sum up to a given element of G. They also determined a closed-form expression for the case where the subsets are required to contain only nonzero elements. In this paper we give an alternative proof of the two formulas. Our argument is purely combinatorial, as in the original proof by Li and Wan, but follows a different and somehow more “natural” approach. We also indicate some new connections with coding theory and combinatorial designs.
On symmetric nonlocal games
2013
Abstract Nonlocal games are used to display differences between the classical and quantum world. In this paper, we study symmetric XOR games, which form an important subset of nonlocal games. We give simple methods for calculating the classical and the quantum values for symmetric XOR games with one-bit input per player. We illustrate those methods with two examples. One example is an N -player game (due to Ardehali (1992) [3] ) that provides the maximum quantum-over-classical advantage. The second example comes from generalization of CHSH game by letting the referee to choose arbitrary symmetric distribution of players’ inputs.
On the hardness of optimization in power-law graphs
2008
Our motivation for this work is the remarkable discovery that many large-scale real-world graphs ranging from Internet and World Wide Web to social and biological networks appear to exhibit a power-law distribution: the number of nodes y"i of a given degree i is proportional to i^-^@b where @b>0 is a constant that depends on the application domain. There is practical evidence that combinatorial optimization in power-law graphs is easier than in general graphs, prompting the basic theoretical question: Is combinatorial optimization in power-law graphs easy? Does the answer depend on the power-law exponent @b? Our main result is the proof that many classical NP-hard graph-theoretic optimizati…
INCIDENCE CONSTRAINTS: A COMBINATORIAL APPROACH
2006
The simplest geometric constraints are incidences between points and lines in the projective plane. This problem is universal, in the sense that all algebraic systems reduce to such geometric constraints. Detecting incidence dependences between these geometric constraints is NP-complete. New methods to prove incidence theorems are proposed, which use strictly no computer algebra but only combinatorial arguments.
P-matrix completions under weak symmetry assumptions
2000
An n-by-n matrix is called a Π-matrix if it is one of (weakly) sign-symmetric, positive, nonnegative P-matrix, (weakly) sign-symmetric, positive, nonnegative P0,1-matrix, or Fischer, or Koteljanskii matrix. In this paper, we are interested in Π-matrix completion problems, that is, when a partial Π-matrix has a Π-matrix completion. Here, we prove that a combinatorially symmetric partial positive P-matrix has a positive P-matrix completion if the graph of its specified entries is an n-cycle. In general, a combinatorially symmetric partial Π-matrix has a Π-matrix completion if the graph of its specified entries is a 1-chordal graph. This condition is also necessary for (weakly) sign-symmetric …