Studies directed towards the synthesis of schisanartane and related complex nortriterpenoids: construction of models of the peripheral ABC and FGH segments of rubrifloradilactone C

A conceptually unifying and flexible approach to the ABC and FGH segments of the nortriterpenoid rubrifloradilactone C, each embodying a furo[3,2-b]furanone moiety, from the appropriate Morita-Baylis-Hillman adducts is delineated. (C) 2010 Elsevier Ltd. All rights reserved.

The hardness of approximating the boxicity, cubicity and threshold dimension of a graph

A k-dimensional box is the Cartesian product R-1 X R-2 X ... X R-k where each R-i is a closed interval on the real line. The boxicity of a graph G, denoted as box(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-dimensional boxes. A unit cube in k-dimensional space 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 oil the real line of the form a(i), a(i) + 1]. The cubicity of G, denoted as cub(G), is the minimum integer k such that G can be represented as the intersection graph of a collection of k-cubes. The threshold dimension of a graph G(V, E) is the smallest integer k such that E can be covered by k threshold spanning subgraphs of G. In this paper we will show that there exists no polynomial-time algorithm for approximating the threshold dimension of a graph on n vertices with a factor of O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. From this result we will show that there exists no polynomial-time algorithm for approximating the boxicity and the cubicity of a graph on n vertices with factor O(n(0.5-epsilon)) for any epsilon > 0 unless NP = ZPP. In fact all these hardness results hold even for a highly structured class of graphs, namely the split graphs. We will also show that it is NP-complete to determine whether a given split graph has boxicity at most 3. (C) 2010 Elsevier B.V. All rights reserved.

Simulation and graph mining tools for improving gene mapping efficiency

Gene mapping is a systematic search for genes that affect observable characteristics of an organism. In this thesis we offer computational tools to improve the efficiency of (disease) gene-mapping efforts. In the first part of the thesis we propose an efficient simulation procedure for generating realistic genetical data from isolated populations. Simulated data is useful for evaluating hypothesised gene-mapping study designs and computational analysis tools. As an example of such evaluation, we demonstrate how a population-based study design can be a powerful alternative to traditional family-based designs in association-based gene-mapping projects. In the second part of the thesis we consider a prioritisation of a (typically large) set of putative disease-associated genes acquired from an initial gene-mapping analysis. Prioritisation is necessary to be able to focus on the most promising candidates. We show how to harness the current biomedical knowledge for the prioritisation task by integrating various publicly available biological databases into a weighted biological graph. We then demonstrate how to find and evaluate connections between entities, such as genes and diseases, from this unified schema by graph mining techniques. Finally, in the last part of the thesis, we define the concept of reliable subgraph and the corresponding subgraph extraction problem. Reliable subgraphs concisely describe strong and independent connections between two given vertices in a random graph, and hence they are especially useful for visualising such connections. We propose novel algorithms for extracting reliable subgraphs from large random graphs. The efficiency and scalability of the proposed graph mining methods are backed by extensive experiments on real data. While our application focus is in genetics, the concepts and algorithms can be applied to other domains as well. We demonstrate this generality by considering coauthor graphs in addition to biological graphs in the experiments.

Macroscopic model of city traffic using bond graph modelling

Modelling of city traffic involves capturing of all the dynamics that exist in real-time traffic. Probabilistic models and queuing theory have been used for mathematical representation of the traffic system. This paper proposes the concept of modelling the traffic system using bond graphs wherein traffic flow is based on energy conservation. The proposed modelling approach uses switched junctions to model complex traffic networks. This paper presents the modelling, simulation and experimental validation aspects.

Discriminative learning of Bayesian networks via factorized conditional log-likelihood

We propose an efficient and parameter-free scoring criterion, the factorized conditional log-likelihood (ˆfCLL), for learning Bayesian network classifiers. The proposed score is an approximation of the conditional log-likelihood criterion. The approximation is devised in order to guarantee decomposability over the network structure, as well as efficient estimation of the optimal parameters, achieving the same time and space complexity as the traditional log-likelihood scoring criterion. The resulting criterion has an information-theoretic interpretation based on interaction information, which exhibits its discriminative nature. To evaluate the performance of the proposed criterion, we present an empirical comparison with state-of-the-art classifiers. Results on a large suite of benchmark data sets from the UCI repository show that ˆfCLL-trained classifiers achieve at least as good accuracy as the best compared classifiers, using significantly less computational resources.

On the Nash-Williams′ Lemma in Graph Reconstruction Theory

A generalization of Nash-Williams′ lemma is proved for the Structure of m-uniform null (m − k)-designs. It is then applied to various graph reconstruction problems. A short combinatorial proof of the edge reconstructibility of digraphs having regular underlying undirected graphs (e.g., tournaments) is given. A type of Nash-Williams′ lemma is conjectured for the vertex reconstruction problem.

Identification of Critical Residues of the Mycobacterial Dephosphocoenzyme A Kinase by Site-Directed Mutagenesis

Dephosphocoenzyme A kinase performs the transfer of the c-phosphate of ATP to dephosphocoenzyme A, catalyzing the last step of coenzyme A biosynthesis. This enzyme belongs to the P-loop-containing NTP hydrolase superfamily, all members of which posses a three domain topology consisting of a CoA domain that binds the acceptor substrate, the nucleotide binding domain and the lid domain. Differences in the enzymatic organization and regulation between the human and mycobacterial counterparts, have pointed out the tubercular CoaE as a high confidence drug target (HAMAP database). Unfortunately the absence of a three-dimensional crystal structure of the enzyme, either alone or complexed with either of its substrates/regulators, leaves both the reaction mechanism unidentified and the chief players involved in substrate binding, stabilization and catalysis unknown. Based on homology modeling and sequence analysis, we chose residues in the three functional domains of the enzyme to assess their contributions to ligand binding and catalysis using site-directed mutagenesis. Systematically mutating the residues from the P-loop and the nucleotide-binding site identified Lys14 and Arg140 in ATP binding and the stabilization of the phosphoryl intermediate during the phosphotransfer reaction. Mutagenesis of Asp32 and Arg140 showed catalytic efficiencies less than 5-10% of the wild type, indicating the pivotal roles played by these residues in catalysis. Non-conservative substitution of the Leu114 residue identifies this leucine as the critical residue from the hydrophobic cleft involved in leading substrate, DCoA binding. We show that the mycobacterial enzyme requires the Mg2+ for its catalytic activity. The binding energetics of the interactions of the mutant enzymes with the substrates were characterized in terms of their enthalpic and entropic contributions by ITC, providing a complete picture of the effects of the mutations on activity. The properties of mutants defective in substrate recognition were consistent with the ordered sequential mechanism of substrate addition for CoaE.

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Binding of active site directed ligands to phospholipase A2: Implications on the molecular constraints and catalytic mechanism

Molecular constraints for the localization of active site directed ligands (competitive inhibitors and substrates) in the active site of phospholipase A2 (PLA2) are characterized. Structure activity relationships with known inhibitors suggest that the head : group interactions dominate the selectivity as well as a substantial part of the affinity. The ab initio fitting of the amide ligands in the active site was carried out to characterize the head group interactions. Based on a systematic coordinate space search, formamide is docked with known experimental constraints such as coordination of the carbonyl group to Ca2+ and hydrogen bond between amide nitrogen and ND1 of His48. An optimal position for a bound water molecule is identified and its significance for the catalytic mechanism is postulated. Unlike the traditional ''pseudo-triad'' mechanism, the ''Ca-coordinatedoxyanion'' mechanism proposed here invokes activation of the catalytic water to form the oxyanion in the coordination sphere of calcium. As it attacks the carbonyl carbon of the ester, a near-tetrahedral intermediate is formed. As the second proton of the catalytic water is abstracted by the ester oxygen, its reorientation and simultaneous cleavage form hydrogen bond with ND1 of His48. In this mechanism of esterolysis, a catalytic role for the water co-ordinated to Ca2+ is recognised.

Heterogeneous permanganate oxidations: Synthesis of medium ring keto-lactones via substituent directed oxidative cyclisation

Homoallyl alcohols 4a-b and 5a-b undergo smooth oxidative cyclisation to give the corresponding ring enlarged keto-lactones under heterogeneous permanganate oxidation conditions.

Hydrogen-bond-directed self-assembly of D-(+)-dibenzoyltartaric acid and 4-aminopyridine: optical nonlinearities and stoichiometry-dependent novel structural features

Attempts to prepare hydrogen-bond-directed nonlinear optical materials from a 1:1 molar mixture Of D-(+)-dibenzoyltartaric acid (DBT, I) and 4-aminopyridine (4-AP, II) resulted in two salts of different stoichiometry. One of them crystallizes in an unusual 1.5:1 (acid:base) monohydrate salt form III while the other one crystallizes as 1:1 (acid:base) salt IV. Crystal structures of both of the salts were determined from single-crystal X-ray diffraction data. The salt III crystallizes in a monoclinic space group C2 with a = 30.339(l), b = 7.881(2), c = 14.355(1) angstrom, beta = 97.48(1)degrees, V = 3403.1(9) angstrom3, Z = 4, R(w) = 0.058, R(w)= 0.058. The salt IV also crystallizes in a monoclinic space group P2(1) with a = 7.500(1), b = 14.968(2), c = 10.370(1) angstrom, beta = 102.67(1)degrees, V = 1135.9(2) angstrom3, Z = 2, R = 0.043, R(w) = 0.043. Interestingly, two DBT molecules with distinctly different conformation are present in the same crystal lattice of salt III. Extensive hydrogen-bonding interactions are found in both of the salts, and both of them show SHG intensity 1.4-1.6 times that of urea.

Conditional linearization in nonlinear random vibration

In this paper, an improved probabilistic linearization approach is developed to study the response of nonlinear single degree of freedom (SDOF) systems under narrow-band inputs. An integral equation for the probability density function (PDF) of the envelope is derived. This equation is solved using an iterative scheme. The technique is applied to study the hardening type Duffing's oscillator under narrow-band excitation. The results compare favorably with those obtained using numerical simulation. In particular, the bimodal nature of the PDF for the response envelope for certain parameter ranges is brought out.

Template directed asymmetric synthesis of the 1,1?-binaphthol unit

An oxidative binaphthol coupling with 65% yield and 65% selectivity has been accomplished using 7-deoxycholic acid as a chiral template.