Exact bounds for distributed graph colouring

A distributed system is a collection of networked autonomous processing units which must work in a cooperative manner. Currently, large-scale distributed systems, such as various telecommunication and computer networks, are abundant and used in a multitude of tasks. The field of distributed computing studies what can be computed efficiently in such systems. Distributed systems are usually modelled as graphs where nodes represent the processors and edges denote communication links between processors. This thesis concentrates on the computational complexity of the distributed graph colouring problem. The objective of the graph colouring problem is to assign a colour to each node in such a way that no two nodes connected by an edge share the same colour. In particular, it is often desirable to use only a small number of colours. This task is a fundamental symmetry-breaking primitive in various distributed algorithms. A graph that has been coloured in this manner using at most k different colours is said to be k-coloured. This work examines the synchronous message-passing model of distributed computation: every node runs the same algorithm, and the system operates in discrete synchronous communication rounds. During each round, a node can communicate with its neighbours and perform local computation. In this model, the time complexity of a problem is the number of synchronous communication rounds required to solve the problem. It is known that 3-colouring any k-coloured directed cycle requires at least ½(log* k - 3) communication rounds and is possible in ½(log* k + 7) communication rounds for all k ≥ 3. This work shows that for any k ≥ 3, colouring a k-coloured directed cycle with at most three colours is possible in ½(log* k + 3) rounds. In contrast, it is also shown that for some values of k, colouring a directed cycle with at most three colours requires at least ½(log* k + 1) communication rounds. Furthermore, in the case of directed rooted trees, reducing a k-colouring into a 3-colouring requires at least log* k + 1 rounds for some k and possible in log* k + 3 rounds for all k ≥ 3. The new positive and negative results are derived using computational methods, as the existence of distributed colouring algorithms corresponds to the colourability of so-called neighbourhood graphs. The colourability of these graphs is analysed using Boolean satisfiability (SAT) solvers. Finally, this thesis shows that similar methods are applicable in capturing the existence of distributed algorithms for other graph problems, such as the maximal matching problem.

Total synthesis of the fungal metabolite (+/-)-acremine G: acceleration of a biomimetic Diels-Alder reaction on silica gel

A total synthesis of the bioactive tetracyclic natural product acremine G has been achieved in which a regio- and stereoselective biomimetic Diels-Alder reaction between two readily assembled building blocks, accelerated on a solid support (silica gel), forms the key step. (c) 2010 Elsevier Ltd. 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.

C-H…O hydrogen bond mediated chain reversal in a peptide containing g-amino acid residue, determined directly from powder X-ray diffraction data

The finding that peptides containing -amino acid residues give rise to folding patterns hitherto unobserved in -amino acid peptides[1] has stimulated considerable interest in the conformational properties of peptides built from , and residues,[2] as the introduction of additional methylene (CH2) units into peptide chains provides further degrees of conformational freedom.

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.

A nanosecond molecular dynamics study of antiparallel d(G)(7) quadruplex structures: Effect of the coordinated cations

Nanosecond scale molecular dynamics simulations have been performed on antiparallel Greek key type d(G(7)) quadruplex structures with different coordinated ions, namely Na+ and K+ ion, water and Na+ counter ions, using the AMBER force field and Particle Mesh Ewald technique for electrostatic interactions. Antiparallel structures are stable during the simulation, with root mean square deviation values of similar to1.5 Angstrom from the initial structures. Hydrogen bonding patterns within the G-tetrads depend on the nature of the coordinated ion, with the G-tetrad undergoing local structural variation to accommodate different cations. However, alternating syn-anti arrangement of bases along a chain as well as in a quartet is maintained through out the MD simulation. Coordinated Na+ ions, within the quadruplex cavity are quite mobile within the central channel and can even enter or exit from the quadruplex core, whereas coordinated K+ ions are quite immobile. MD studies at 400 K indicate that K+ ion cannot come out from the quadruplex core without breaking the terminal G-tetrads. Smaller grooves in antiparallel structures are better binding sites for hydrated counter ions, while a string of hydrogen bonded water molecules are observed within both the small and large grooves. The hydration free energy for the K+ ion coordinated structure is more favourable than that for the Na+ ion coordinated antiparallel quadruplex structure.

Effect of coordinated ions on structure and flexiblity of parallel G-quandruplexes: a molecular dynamics study

Single tract guanine residues can associate to form stable parallel quadruplex structures in the presence of certain cations. Nanosecond scale molecular dynamics simulations have been performed on fully solvated fibre model of parallel d(G7) quadruplex structures with Na+ or K+ ions coordinated in the cavity formed by the 06 atoms of the guanine bases. The AMBER 4.1 force field and Particle Mesh Ewald technique for electrostatic interactions have been used in all simulations. These quadruplex structures are stable during the simulation, with the middle four base tetrads showing root mean square deviation values between 0.5 to 0.8 A from the initial structure as well the high resolution crystal structure. Even in the absence of any coordinated ion in the initial structure, the G-quadruplex structure remains intact throughout the simulation. During the 1.1 ns MD simulation, one Na+ counter ion from the solvent as well as several water molecules enter the central cavity to occupy the empty coordination sites within the parallel quadruplex and help stabilize the structure. Hydrogen bonding pattern depends on the nature of the coordinated ion, with the G-tetrad undergoing local structural variation to accommodate cations of different sizes. In the absence of any coordinated ion, due to strong mutual repulsion, 06 atoms within G-tetrad are forced farther apart from each other, which leads to a considerably different hydrogen bonding scheme within the G-tetrads and very favourable interaction energy between the guanine bases constituting a G-tetrad. However, a coordinated ion between G-tetrads provides extra stacking energy for the G-tetrads and makes the quadruplex structure more rigid. Na+ ions, within the quadruplex cavity, are more mobile than coordinated K+ ions. A number of hydrogen bonded water molecules are observed within the grooves of all quadruplex structures

Compression of Weighted Graphs

We propose to compress weighted graphs (networks), motivated by the observation that large networks of social, biological, or other relations can be complex to handle and visualize. In the process also known as graph simplication, nodes and (unweighted) edges are grouped to supernodes and superedges, respectively, to obtain a smaller graph. We propose models and algorithms for weighted graphs. The interpretation (i.e. decompression) of a compressed, weighted graph is that a pair of original nodes is connected by an edge if their supernodes are connected by one, and that the weight of an edge is approximated to be the weight of the superedge. The compression problem now consists of choosing supernodes, superedges, and superedge weights so that the approximation error is minimized while the amount of compression is maximized. In this paper, we formulate this task as the 'simple weighted graph compression problem'. We then propose a much wider class of tasks under the name of 'generalized weighted graph compression problem'. The generalized task extends the optimization to preserve longer-range connectivities between nodes, not just individual edge weights. We study the properties of these problems and propose a range of algorithms to solve them, with dierent balances between complexity and quality of the result. We evaluate the problems and algorithms experimentally on real networks. The results indicate that weighted graphs can be compressed efficiently with relatively little compression error.

Molecular dynamics simulations on parallel and antiparallel C.G*G triplexes

Molecular dynamics (MD) studies have been carried out on the Hoogsteen hydrogen bonded parallel and the reverse Hoogsteen hydrogen banded antiparallel C.G*G triplexes. Earlier, the molecular mechanics studies had shown that the parallel structure was energetically more favourable than the antiparallel structure. To characterize the structural stability of the two triplexes and to investigate whether the antiparallel structure can transit to an energetically more favourable structure, due to the local fluctuations in the structure during the MD simulation, the two structures were subjected to 200ps of constant temperature vacuum MD simulations at 300K. Initially no constraints were applied to the structures and it was observed that for the antiparallel tripler, the structure showed a large root mean square deviation from the starting structure within the first 12ps and the N4-H41-O6 hydrogen bond in the WC duplex got distorted due to a high propeller twist and a moderate increase in the opening angle in the basepairs. Starting from an initial value of 30 degrees, helical twist of the average structure from this simulation had a value of 36 degrees, while the parallel structure stabilized at a twist of 33 degrees. In spite of the hydrogen bond distortions in the antiparallel tripler, it was energetically comparable to the parallel tripler. To examine the structural characteristics of an undistorted structure, another MD simulation was performed on the antiparallel tripler by constraining all the hydrogen bonds. This structure stabilized at an average twist of 33 degrees. In the course of the dynamics though the energy of the molecule - compared to the initial structure - improved, it did not become comparable to the parallel structure. Energy minimization studies performed in the presence of explicit water and counterions also showed the two structures to be equally favourable energetically Together these results indicate that the parallel C.G*G tripler with Hoogsteen hydrogen bonds also represents a stereochemically and energetically favourable structure for this class of triplexes.

Conformational Polymorphism in G-tetraplex Structures: Strand Reversal by Base Flipover or Sugar Flipover

Guanine rich sequences adopt a variety of four stranded structures, which differ in strand orientation and conformation about the glycosidic bond even though they are all stabilised by Hoogsteen hydrogen bonded guanine tetrads. Detailed model building and molecular mechanics calculations have been carried out to investigate various possible conformations of guanines along a strand and different possible orientations of guanine strands in a G-tetraplex structure. It is found that for an oligo G stretch per se, a parallel four stranded structure with all guanines in anti conformation is favoured over other possible tetraplex structures. Hence an alternating syn-anti arrangement of guanines along a strand is likely to occur only in folded back tetraplex structures with antiparallel G strands. Our study provides a theoretical rationale for the observed alternation of glycosidic conformation and the inverted stacking arrangement arising from base flipover, in antiparallel G-tetraplex structures and also highlights the various structural features arising due to different types of strand orientations. The molecular mechanics calculations help in elucidating the various interactions which stabilize different G-tetraplex structures and indicate that screening of phosphate charge by counterions could have a dramatic effect on groove width in these four stranded structures.