4,182 research outputs found

    GraphCombEx: A Software Tool for Exploration of Combinatorial Optimisation Properties of Large Graphs

    Full text link
    We present a prototype of a software tool for exploration of multiple combinatorial optimisation problems in large real-world and synthetic complex networks. Our tool, called GraphCombEx (an acronym of Graph Combinatorial Explorer), provides a unified framework for scalable computation and presentation of high-quality suboptimal solutions and bounds for a number of widely studied combinatorial optimisation problems. Efficient representation and applicability to large-scale graphs and complex networks are particularly considered in its design. The problems currently supported include maximum clique, graph colouring, maximum independent set, minimum vertex clique covering, minimum dominating set, as well as the longest simple cycle problem. Suboptimal solutions and intervals for optimal objective values are estimated using scalable heuristics. The tool is designed with extensibility in mind, with the view of further problems and both new fast and high-performance heuristics to be added in the future. GraphCombEx has already been successfully used as a support tool in a number of recent research studies using combinatorial optimisation to analyse complex networks, indicating its promise as a research software tool

    Materials for stem cell factories of the future

    Get PDF
    The materials community is now identifying polymeric substrates that could permit translation of human pluripotent stem cells (hPSCs) from lab-based research to industrial scale biomedicine. Well defined materials are required to allow cell banking and to provide the raw material for reproducible differentiation into lineages for large scale drug screening programs and clinical use, wherein >1 billion cells for each patient are needed to replace losses during heart attack, multiple sclerosis and diabetes. Producing this number of cells for one patient is challenging and a rethink is needed to scalable technology with the potential to meet the needs of millions of patients a year. Here we consider the role of materials discovery, an emerging area of materials chemistry that is in a large part driven by the challenges posed by biologists to materials scientists1-4

    Innovative in silico approaches to address avian flu using grid technology

    Get PDF
    The recent years have seen the emergence of diseases which have spread very quickly all around the world either through human travels like SARS or animal migration like avian flu. Among the biggest challenges raised by infectious emerging diseases, one is related to the constant mutation of the viruses which turns them into continuously moving targets for drug and vaccine discovery. Another challenge is related to the early detection and surveillance of the diseases as new cases can appear just anywhere due to the globalization of exchanges and the circulation of people and animals around the earth, as recently demonstrated by the avian flu epidemics. For 3 years now, a collaboration of teams in Europe and Asia has been exploring some innovative in silico approaches to better tackle avian flu taking advantage of the very large computing resources available on international grid infrastructures. Grids were used to study the impact of mutations on the effectiveness of existing drugs against H5N1 and to find potentially new leads active on mutated strains. Grids allow also the integration of distributed data in a completely secured way. The paper presents how we are currently exploring how to integrate the existing data sources towards a global surveillance network for molecular epidemiology.Comment: 7 pages, submitted to Infectious Disorders - Drug Target

    Discovery of Stable and Selective Antibody Mimetics from Combinatorial Libraries of Polyvalent, Loop-Functionalized Peptoid Nanosheets.

    Get PDF
    The ability of antibodies to bind a wide variety of analytes with high specificity and high affinity makes them ideal candidates for therapeutic and diagnostic applications. However, the poor stability and high production cost of antibodies have prompted exploration of a variety of synthetic materials capable of specific molecular recognition. Unfortunately, it remains a fundamental challenge to create a chemically diverse population of protein-like, folded synthetic nanostructures with defined molecular conformations in water. Here we report the synthesis and screening of combinatorial libraries of sequence-defined peptoid polymers engineered to fold into ordered, supramolecular nanosheets displaying a high spatial density of diverse, conformationally constrained peptoid loops on their surface. These polyvalent, loop-functionalized nanosheets were screened using a homogeneous Förster resonance energy transfer (FRET) assay for binding to a variety of protein targets. Peptoid sequences were identified that bound to the heptameric protein, anthrax protective antigen, with high avidity and selectivity. These nanosheets were shown to be resistant to proteolytic degradation, and the binding was shown to be dependent on the loop display density. This work demonstrates that key aspects of antibody structure and function-the creation of multivalent, combinatorial chemical diversity within a well-defined folded structure-can be realized with completely synthetic materials. This approach enables the rapid discovery of biomimetic affinity reagents that combine the durability of synthetic materials with the specificity of biomolecular materials

    An efficient graph generative model for navigating ultra-large combinatorial synthesis libraries

    Full text link
    Virtual, make-on-demand chemical libraries have transformed early-stage drug discovery by unlocking vast, synthetically accessible regions of chemical space. Recent years have witnessed rapid growth in these libraries from millions to trillions of compounds, hiding undiscovered, potent hits for a variety of therapeutic targets. However, they are quickly approaching a size beyond that which permits explicit enumeration, presenting new challenges for virtual screening. To overcome these challenges, we propose the Combinatorial Synthesis Library Variational Auto-Encoder (CSLVAE). The proposed generative model represents such libraries as a differentiable, hierarchically-organized database. Given a compound from the library, the molecular encoder constructs a query for retrieval, which is utilized by the molecular decoder to reconstruct the compound by first decoding its chemical reaction and subsequently decoding its reactants. Our design minimizes autoregression in the decoder, facilitating the generation of large, valid molecular graphs. Our method performs fast and parallel batch inference for ultra-large synthesis libraries, enabling a number of important applications in early-stage drug discovery. Compounds proposed by our method are guaranteed to be in the library, and thus synthetically and cost-effectively accessible. Importantly, CSLVAE can encode out-of-library compounds and search for in-library analogues. In experiments, we demonstrate the capabilities of the proposed method in the navigation of massive combinatorial synthesis libraries.Comment: 36th Conference on Neural Information Processing Systems (NeurIPS 2022

    SOBER: Highly Parallel Bayesian Optimization and Bayesian Quadrature over Discrete and Mixed Spaces

    Full text link
    Batch Bayesian optimisation and Bayesian quadrature have been shown to be sample-efficient methods of performing optimisation and quadrature where expensive-to-evaluate objective functions can be queried in parallel. However, current methods do not scale to large batch sizes -- a frequent desideratum in practice (e.g. drug discovery or simulation-based inference). We present a novel algorithm, SOBER, which permits scalable and diversified batch global optimisation and quadrature with arbitrary acquisition functions and kernels over discrete and mixed spaces. The key to our approach is to reformulate batch selection for global optimisation as a quadrature problem, which relaxes acquisition function maximisation (non-convex) to kernel recombination (convex). Bridging global optimisation and quadrature can efficiently solve both tasks by balancing the merits of exploitative Bayesian optimisation and explorative Bayesian quadrature. We show that SOBER outperforms 11 competitive baselines on 12 synthetic and diverse real-world tasks.Comment: 34 pages, 12 figure
    corecore