Alkyl radical geometry controls geminate cage recombination in alkylcobalamins

Abstract: The radical pair that results from photolysis of adenosylcob(II1)alamin (AdoCbl"') undergoes primary geminate recombination with a first-order rate constant of 1 x lo9 s-l. In contrast, methylcob(II1)alamin (CH3Cbl"') and aristeromicylcob(II1)alamin (AriCblII', the carbocyclic analogue of AdoCbl"' in which the ribofuranose ring oxygen has been replaced with a methylene group) does not undergo primary geminate recombination. The ribofwanose group enables a high rate of geminate recombination in the [Ado' Cbl"'] radical pair. This may be due to a stereoelectronic (p-anomeric) effect that maintains a pyramidal geometry at the 5'-carbon of the 5'-deoxyadenosyl radical, or it may be due to hindered rotation about the C4t-C5, bond such that /?-elimination to the olefin is prevented. Recombination in the geminate singlet radical pair is in competition with diffusive escape to form a solvent-separated radical pair. Hyperfine coupling from Co" promotes intersystem crossing to the triplet radical pair (Chagovetz, A. M.; Grissom, C. B. J. Am. Chem. SOC. 1993, 115, 12152). Recombination of the [CH3' Cbl"] radical pair is not prevented by a lack of intersystem crossing, as neither unlabeled or I3C-labeled CH3Cbl"' undergoes geminate recombination. There is only a small difference in the rate of diffusive recombination in the solvent cage for AdoCbl"', AriCbl"', and CH3Cbl"' following photolysis: 2.01 x 10" s-l, 2.20 x lo4 s-l, and 1.16 x lo4 s-l. The rate of diffusive recombination is limited by productive collisions and not by radical geometry or intersystem crossing. The CF3' radical that results from photolysis of (trifluoromethyl)cob(III)alamin (CF3Cbl"') maintains its pyramidal geometry and undergoes faster diffusive recombination in the solvent cage at 51 x lo4 s-l. The C-Co bond dissociation enthalpy in AriCbl"' is 37 f 1.4 kcaymol. The profound difference in geminate recombination rates for AdoCbl"' and CH3Cbl"' is consistent with their different biological roles as enzymatic cofactors: AdoCbl"' is an initiator of radical chain chemistry in the active site, whereas CH3Cbl"' is a methyl group donor in an S~2-type process.

Genome-wide association study identifies new multiple sclerosis susceptibility loci on chromosomes 12 and 20

To identify multiple sclerosis (MS) susceptibility loci, we conducted a genome-wide association study (GWAS) in 1,618 cases and used shared data for 3,413 controls. We performed replication in an independent set of 2,256 cases and 2,310 controls, for a total of 3,874 cases and 5,723 controls. We identified risk-associated SNPs on chromosome 12q13-14 (rs703842, P = 5.4 x 10(-11); rs10876994, P = 2.7 x 10(-10); rs12368653, P = 1.0 x 10(-7)) and upstream of CD40 on chromosome 20q13 (rs6074022, P = 1.3 x 10(-7); rs1569723, P = 2.9 x 10(-7)). Both loci are also associated with other autoimmune diseases. We also replicated several known MS associations (HLA-DR15, P = 7.0 x 10(-184); CD58, P = 9.6 x 10(-8); EVI5-RPL5, P = 2.5 x 10(-6); IL2RA, P = 7.4 x 10(-6); CLEC16A, P = 1.1 x 10(-4); IL7R, P = 1.3 x 10(-3); TYK2, P = 3.5 x 10(-3)) and observed a statistical interaction between SNPs in EVI5-RPL5 and HLA-DR15 (P = 0.001).

Multi-party computation with omnipresent adversary

Secure multi-party computation (MPC) protocols enable a set of n mutually distrusting participants P 1, ..., P n , each with their own private input x i , to compute a function Y = F(x 1, ..., x n ), such that at the end of the protocol, all participants learn the correct value of Y, while secrecy of the private inputs is maintained. Classical results in the unconditionally secure MPC indicate that in the presence of an active adversary, every function can be computed if and only if the number of corrupted participants, t a , is smaller than n/3. Relaxing the requirement of perfect secrecy and utilizing broadcast channels, one can improve this bound to t a  < n/2. All existing MPC protocols assume that uncorrupted participants are truly honest, i.e., they are not even curious in learning other participant secret inputs. Based on this assumption, some MPC protocols are designed in such a way that after elimination of all misbehaving participants, the remaining ones learn all information in the system. This is not consistent with maintaining privacy of the participant inputs. Furthermore, an improvement of the classical results given by Fitzi, Hirt, and Maurer indicates that in addition to t a actively corrupted participants, the adversary may simultaneously corrupt some participants passively. This is in contrast to the assumption that participants who are not corrupted by an active adversary are truly honest. This paper examines the privacy of MPC protocols, and introduces the notion of an omnipresent adversary, which cannot be eliminated from the protocol. The omnipresent adversary can be either a passive, an active or a mixed one. We assume that up to a minority of participants who are not corrupted by an active adversary can be corrupted passively, with the restriction that at any time, the number of corrupted participants does not exceed a predetermined threshold. We will also show that the existence of a t-resilient protocol for a group of n participants, implies the existence of a t’-private protocol for a group of n′ participants. That is, the elimination of misbehaving participants from a t-resilient protocol leads to the decomposition of the protocol. Our adversary model stipulates that a MPC protocol never operates with a set of truly honest participants (which is a more realistic scenario). Therefore, privacy of all participants who properly follow the protocol will be maintained. We present a novel disqualification protocol to avoid a loss of privacy of participants who properly follow the protocol.

A combinatorial approach to anonymous membership broadcast

A set system (X, F ) with X= {x 1,...,x m}) and F = {B1...,B n }, where B i ⊆ X, is called an (n, m) cover-free set system (or CF set system) if for any 1 ≤ i, j, k ≤ n and j ≠ k, |B i >2 |B j ∩ B k | +1. In this paper, we show that CF set systems can be used to construct anonymous membership broadcast schemes (or AMB schemes), allowing a center to broadcast a secret identity among a set of users in a such way that the users can verify whether or not the broadcast message contains their valid identity. Our goal is to construct (n, m) CF set systems in which for given m the value n is as large as possible. We give two constructions for CF set systems, the first one from error-correcting codes and the other from combinatorial designs. We link CF set systems to the concept of cover-free family studied by Erdös et al in early 80’s to derive bounds on parameters of CF set systems. We also discuss some possible extensions of the current work, motivated by different application.

On secure multi-party computation in black-box groups

We study the natural problem of secure n-party computation (in the passive, computationally unbounded attack model) of the n-product function f G (x 1,...,x n ) = x 1 ·x 2 ⋯ x n in an arbitrary finite group (G,·), where the input of party P i is x i  ∈ G for i = 1,...,n. For flexibility, we are interested in protocols for f G which require only black-box access to the group G (i.e. the only computations performed by players in the protocol are a group operation, a group inverse, or sampling a uniformly random group element). Our results are as follows. First, on the negative side, we show that if (G,·) is non-abelian and n ≥ 4, then no ⌈n/2⌉-private protocol for computing f G exists. Second, on the positive side, we initiate an approach for construction of black-box protocols for f G based on k-of-k threshold secret sharing schemes, which are efficiently implementable over any black-box group G. We reduce the problem of constructing such protocols to a combinatorial colouring problem in planar graphs. We then give two constructions for such graph colourings. Our first colouring construction gives a protocol with optimal collusion resistance t < n/2, but has exponential communication complexity O(n*2t+1^2/t) group elements (this construction easily extends to general adversary structures). Our second probabilistic colouring construction gives a protocol with (close to optimal) collusion resistance t < n/μ for a graph-related constant μ ≤ 2.948, and has efficient communication complexity O(n*t^2) group elements. Furthermore, we believe that our results can be improved by further study of the associated combinatorial problems.

Co-regulatory potential of vascular endothelial growth factor–A and vascular endothelial growth factor–C in thyroid carcinoma

Vascular endothelial growth factor (VEGF) promotes growth of blood or lymphatic vessels. The aim of the current study is to identify relationships between VEGF-A and VEGF-C, and their impact in angiogenesis and metastases in thyroid cancers. VEGF-A and VEGF-C mRNA and protein expression was investigated in 136 thyroid cancers (123 papillary thyroid carcinomas and 13 undifferentiated thyroid carcinomas) and 40 matched lymph node metastases with papillary thyroid carcinoma using reverse transcription polymerase chain reaction and immunohistochemistry. VEGF-A and VEGF-C mRNA expression was significantly different between conventional papillary thyroid carcinoma, follicular variant of papillary thyroid carcinoma, and undifferentiated thyroid carcinomas (P = 1 x 10(-6) and 1 x 10(-5), respectively). In undifferentiated carcinoma, VEGF-A and VEGF-C protein overexpression was noted in all cases. VEGF-A and VEGF-C mRNA overexpression was noted in 51% (n = 62) and 27% (n = 33) of the papillary thyroid carcinomas, whereas VEGF-A and VEGF-C protein overexpression was also identified in 70% (n = 86) and 62% (n = 76) of the carcinomas. VEGF-A mRNA was significantly higher in cancers with lymph node metastases compared with nonmetastatic cancers (P = .001), whereas most metastatic cancers underexpressed VEGF-C (P = .0002), with a similar trend for protein. The expression of VEGF-A and VEGF-C correlated with each other at both mRNA and protein levels (P = .00004 and .003, respectively). In summary, VEGF-A and -C expressions correlate with the pathological parameters and metastatic status of thyroid carcinomas. The significant correlations between the expressions of these genes add weight to hypotheses concerning VEGF-A and -C interaction in cancer progression.

A genome-wide screen for susceptibility loci in ankylosing spondylitis

Objective. To localize the regions containing genes that determine susceptibility to ankylosing spondylitis (AS). Methods. One hundred five white British families with 121 affected sibling pairs with AS were recruited, largely from the Royal National Hospital for Rheumatic Diseases AS database. A genome-wide linkage screen was undertaken using 254 highly polymorphic microsatellite markers from the Medical Research Council (UK) (MRC) set. The major histocompatibility complex (MHC) region was studied more intensively using 5 microsatellites lying within the HLA class III region and HLA-DRB1 typing. The Analyze package was used for 2-point analysis, and GeneHunter for multipoint analysis. Results. When only the MRC set was considered, 11 markers in 7 regions achieved a P value of ≤0.01. The maximum logarithm of odds score obtained was 3.8 (P = 1.4 x 10-5) using marker D6S273, which lies in the HLA class III region. A further marker used in mapping of the MHC class III region achieved a LOD score of 8.1 (P = 1 x 10-9). Nine of 118 affected sibling pairs (7.6%) did not share parental haplotypes identical by descent across the MHC, suggesting that only 31% of the susceptibility to AS is coded by genes linked to the MHC. The maximum non-MHC LOD score obtained was 2.6 (P = 0.0003) for marker D16S422. Conclusion. The results of this study confirm the strong linkage of the MHC with AS, and provide suggestive evidence regarding the presence and location of non-MHC genes influencing susceptibility to the disease.

Numerical analysis of a new space-time variable fractional order advection-dispersion equation

Many physical processes appear to exhibit fractional order behavior that may vary with time and/or space. The continuum of order in the fractional calculus allows the order of the fractional operator to be considered as a variable. In this paper, we consider a new space–time variable fractional order advection–dispersion equation on a finite domain. The equation is obtained from the standard advection–dispersion equation by replacing the first-order time derivative by Coimbra’s variable fractional derivative of order α(x)∈(0,1]α(x)∈(0,1], and the first-order and second-order space derivatives by the Riemann–Liouville derivatives of order γ(x,t)∈(0,1]γ(x,t)∈(0,1] and β(x,t)∈(1,2]β(x,t)∈(1,2], respectively. We propose an implicit Euler approximation for the equation and investigate the stability and convergence of the approximation. Finally, numerical examples are provided to show that the implicit Euler approximation is computationally efficient.

A highly efficient and consistent method for harvesting large volumes of high-titre lentiviral vectors

Lentiviral vectors pseudotyped with vesicular stomatitis virus glycoprotein (VSV-G) are emerging as the vectors of choice for in vitro and in vivo gene therapy studies. However, the current method for harvesting lentivectors relies upon ultracentrifugation at 50 000 g for 2 h. At this ultra-high speed, rotors currently in use generally have small volume capacity. Therefore, preparations of large volumes of high-titre vectors are time-consuming and laborious to perform. In the present study, viral vector supernatant harvests from vector-producing cells (VPCs) were pre-treated with various amounts of poly-L-lysine (PLL) and concentrated by low speed centrifugation. Optimal conditions were established when 0.005% of PLL (w/v) was added to vector supernatant harvests, followed by incubation for 30 min and centrifugation at 10 000 g for 2 h at 4 degreesC. Direct comparison with ultracentrifugation demonstrated that the new method consistently produced larger volumes (6 ml) of high-titre viral vector at 1 x 10(8) transduction unit (TU)/ml (from about 3000 ml of supernatant) in one round of concentration. Electron microscopic analysis showed that PLL/viral vector formed complexes, which probably facilitated easy precipitation at low-speed concentration (10 000 g), a speed which does not usually precipitate viral particles efficiently. Transfection of several cell lines in vitro and transduction in vivo in the liver with the lentivector/PLL complexes demonstrated efficient gene transfer without any significant signs of toxicity. These results suggest that the new method provides a convenient means for harvesting large volumes of high-titre lentivectors, facilitate gene therapy experiments in large animal or human gene therapy trials, in which large amounts of lentiviral vectors are a prerequisite.

Giant Magnetoresistance and Related Properties of Rare Earth Manganates and Other Oxide Systems

Giant magnetoresistance (GMR), which was until recently confined to magnetic layered and granular materials, as well as doped magnetic semiconductors, occurs in manganate perovskites of the general formula Ln(1-x)A(x)MnO(3) (Ln = rare earth; A = divalent ion). These manganates are ferromagnetic at or above a certain value of x (or Mn4+ content) and become metallic at temperatures below the curie temperature, T-c. GMR is generally a maximum close to T-c or the insulator-metal (I-M) transition temperature, T-im. The T-c and %MR are markedly affected by the size of the A site cation, [r(A)], thereby affording a useful electronic phase diagram when T-c or T-im is plotted against [r(A)]. We discuss GMR and related properties of manganates in polycrystalline, thin-film, and single-crystal forms and point out certain commonalities and correlations. We also examine some unusual features in the electron-transport properties of manganates, in particular charge-ordering effects. Charge ordering is crucially dependent on [r(A)] or the e(g) band width, and the charge-ordered insulating state transforms to a metallic ferromagnetic state on the application of a magnetic field.

Colossal dielectric behavior of semiconducting Sr2TiMnO6 ceramics

Manganitelike double perovskite Sr2TiMnO6 (STMO) ceramics fabricated from the powders synthesized via the solid-state reaction route, exhibited dielectric constants as high as similar to 10(5) in the low frequency range (100 Hz-10 kHz) at room temperature. The Maxwell-Wagner type of relaxation mechanism was found to be more appropriate to rationalize such high dielectric constant values akin to that observed in materials such as KxTiyNi(1-x-y)O and CaCu3Ti4O12. The dielectric measurements carried out on the samples with different thicknesses and electrode materials reflected the influence of extrinsic effects. The impedance studies (100 Hz-10 MHz) in the 180-300 K temperature range revealed the presence of two dielectric relaxations corresponding to the grain boundary and the electrode. The dielectric response of the grain boundary was found to be weakly dependent on the dc bias field (up to 11 V/cm). However, owing to the electrode polarization, the applied ac/dc field had significant effect on the low frequency dielectric response. At low temperatures (100-180 K), the dc conductivity of STMO followed a variable range hopping behavior. Above 180 K, it followed the Arrhenius behavior because of the thermally activated conduction process. The bulk conductivity relaxation owing to the localized hopping of charge carriers obeyed the typical universal dielectric response.

Colossal dielectric behavior of semiconducting $Sr_{2}TiMnO_{6}$ ceramics

Manganitelike double perovskite Sr2TiMnO6 (STMO) ceramics fabricated from the powders synthesized via the solid-state reaction route, exhibited dielectric constants as high as similar to 10(5) in the low frequency range (100 Hz-10 kHz) at room temperature. The Maxwell-Wagner type of relaxation mechanism was found to be more appropriate to rationalize such high dielectric constant values akin to that observed in materials such as KxTiyNi(1-x-y)O and CaCu3Ti4O12. The dielectric measurements carried out on the samples with different thicknesses and electrode materials reflected the influence of extrinsic effects. The impedance studies (100 Hz-10 MHz) in the 180-300 K temperature range revealed the presence of two dielectric relaxations corresponding to the grain boundary and the electrode. The dielectric response of the grain boundary was found to be weakly dependent on the dc bias field (up to 11 V/cm). However, owing to the electrode polarization, the applied ac/dc field had significant effect on the low frequency dielectric response. At low temperatures (100-180 K), the dc conductivity of STMO followed a variable range hopping behavior. Above 180 K, it followed the Arrhenius behavior because of the thermally activated conduction process. The bulk conductivity relaxation owing to the localized hopping of charge carriers obeyed the typical universal dielectric response.

Influence of lanthanum doping on the dielectric, ferroelectric and relaxor behaviour of barium bismuth titanate ceramics

Barium lanthanum bismuth titanate (Ba1−(3/2)xLaxBi4Ti4O15, x = 0–0.4) ceramics were fabricated using the powders synthesized via the solid-state reaction route. X-ray powder diffraction analysis confirmed the above compositions to be monophasic and belonged to the m = 4 member of the Aurivillius family of oxides. The effect of the partial presence of La3+ on Ba2+ sites on the microstructure, dielectric and relaxor behaviour of BaBi4Ti4O15 (BBT) ceramics was investigated. For the compositions pertaining to x ≤ 0.1, the dielectric constant at both room temperature and in the vicinity of the temperature of the dielectric maximum (Tm) of the parent phase (BBT) increased significantly with an increase in x while Tm remained almost constant. Tm shifted towards lower temperatures accompanied by a decrease in the magnitude of the dielectric maximum (εm) with an increase in the lanthanum content (0.1 < x ≤ 0.4). The dielectric relaxation was modelled using the Vogel–Fulcher relation and a decrease in the activation energy for frequency dispersion with increasing x was observed. The frequency dispersion of Tm was found to decrease with an increase in lanthanum doping, and for compositions corresponding to x ≥ 0.3, Tm was frequency independent. Well-developed P(polarization)–E(electric field) hysteresis loops were observed at 150 °C for all the samples and the remanent polarization (2Pr) was improved from 6.3 µC cm−2 for pure BBT to 13.4 µC cm−2 for Ba0.7La0.2Bi4Ti4O15 ceramics. Dc conductivities and associated activation energies were evaluated using impedance spectroscopy.

On the cubicity of bipartite graphs

A unit cube in k-dimension (or a k-cube) is defined as the Cartesian product R-1 x R-2 x ... x R-k, where each R-i is a closed interval on the real line of the form [a(j), a(i), + 1]. The cubicity of G, denoted as cub(G), is the minimum k such that G is the intersection graph of a collection of k-cubes. Many NP-complete graph problems can be solved efficiently or have good approximation ratios in graphs of low cubicity. In most of these cases the first step is to get a low dimensional cube representation of the given graph. It is known that for graph G, cub(G) <= left perpendicular2n/3right perpendicular. Recently it has been shown that for a graph G, cub(G) >= 4(Delta + 1) In n, where n and Delta are the number of vertices and maximum degree of G, respectively. In this paper, we show that for a bipartite graph G = (A boolean OR B, E) with |A| = n(1), |B| = n2, n(1) <= n(2), and Delta' = min {Delta(A),Delta(B)}, where Delta(A) = max(a is an element of A)d(a) and Delta(B) = max(b is an element of B) d(b), d(a) and d(b) being the degree of a and b in G, respectively , cub(G) <= 2(Delta' + 2) bar left rightln n(2)bar left arrow. We also give an efficient randomized algorithm to construct the cube representation of G in 3 (Delta' + 2) bar right arrowIn n(2)bar left arrow dimension. The reader may note that in general Delta' can be much smaller than Delta.

An upper bound for Cubicity in terms of Boxicity

An axis-parallel b-dimensional box is a Cartesian product R-1 x R-2 x ... x R-b where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), b(i)] on the real line. The boxicity of any graph G, box(G) is the minimum positive integer b such that G can be represented as the intersection graph of axis-parallel b-dimensional boxes. A b-dimensional cube is a Cartesian product R-1 x R-2 x ... x R-b, where each R-i (for 1 <= i <= b) is a closed interval of the form [a(i), a(i) + 1] on the real line. When the boxes are restricted to be axis-parallel cubes in b-dimension, the minimum dimension b required to represent the graph is called the cubicity of the graph (denoted by cub(G)). In this paper we prove that cub(G) <= inverted right perpendicularlog(2) ninverted left perpendicular box(G), where n is the number of vertices in the graph. We also show that this upper bound is tight.Some immediate consequences of the above result are listed below: 1. Planar graphs have cubicity at most 3inverted right perpendicularlog(2) ninvereted left perpendicular.2. Outer planar graphs have cubicity at most 2inverted right perpendicularlog(2) ninverted left perpendicular.3. Any graph of treewidth tw has cubicity at most (tw + 2) inverted right perpendicularlog(2) ninverted left perpendicular. Thus, chordal graphs have cubicity at most (omega + 1) inverted right erpendicularlog(2) ninverted left perpendicular and circular arc graphs have cubicity at most (2 omega + 1)inverted right perpendicularlog(2) ninverted left perpendicular, where omega is the clique number.