Experimental Evaluation of Subgraph Isomorphism Solvers

International audienceSubgraph Isomorphism (SI) is an NP-complete problem which is at the heart of many structural pattern recognition tasks as it involves finding a copy of a pattern graph into a target graph. In the pattern recognition community, the most well-known SI solvers are VF2, VF3, and RI. SI is also widely studied in the constraint programming community, and many constraint-based SI solvers have been proposed since Ullman, such as LAD and Glasgow, for example. All these SI solvers can solve very quickly some large SI instances, that involve graphs with thousands of nodes. However, McCreesh et al. have recently shown how to randomly generate SI instances the hardness of which can be controlled and predicted, and they have built small instances which are computationally challenging for all solvers. They have also shown that some small instances, which are predicted to be easy and are easily solved by constraint-based solvers, appear to be challenging for VF2 and VF3. In this paper, we widen this study by considering a large test suite coming from eight benchmarks. We show that, as expected for an NP-complete problem, the solving time of an instance does not depend on its size, and that some small instances coming from real applications are not solved by any of the considered solvers. We also show that, if RI and VF3 can solve very quickly a large number of easy instances, for which Glasgow or LAD need more time, they fail at solving some other instances that are quickly solved by Glasgow or LAD, and they are clearly outperformed by Glasgow on hard instances. Finally, we show that we can easily combine solvers to take benefit of their complementarity

A Parallel, Backjumping Subgraph Isomorphism Algorithm Using Supplemental Graphs

This registry entry contains a reference to the code, data and experimental scripts needed to reproduce the subgraph isomorphism paper: Ciaran McCreesh and Patrick Prosser, "A Parallel, Backjumping Subgraph Isomorphism Algorithm using Supplemental Graphs". To appear at the 21st International Conference on Principles and Practice of Constraint Programming (CP 2015)

The Index-Based Subgraph Matching Algorithm (ISMA): Fast Subgraph Enumeration in Large Networks Using Optimized Search Trees

Subgraph matching algorithms are designed to find all instances of predefined subgraphs in a large graph or network and play an important role in the discovery and analysis of so-called network motifs, subgraph patterns which occur more often than expected by chance. We present the index-based subgraph matching algorithm (ISMA), a novel tree-based algorithm. ISMA realizes a speedup compared to existing algorithms by carefully selecting the order in which the nodes of a query subgraph are investigated. In order to achieve this, we developed a number of data structures and maximally exploited symmetry characteristics of the subgraph. We compared ISMA to a naive recursive tree-based algorithm and to a number of well-known subgraph matching algorithms. Our algorithm outperforms the other algorithms, especially on large networks and with large query subgraphs. An implementation of ISMA in Java is freely available at http://sourceforge.net/projects/isma

TDP-43 Identified from a Genome Wide RNAi Screen for SOD1 Regulators

Amyotrophic Lateral Sclerosis (ALS) is a late-onset, progressive neurodegenerative disease affecting motor neurons in the brain stem and spinal cord leading to loss of voluntary muscular function and ultimately, death due to respiratory failure. A subset of ALS cases are familial and associated with mutations in superoxide dismutase 1 (SOD1) that destabilize the protein and predispose it to aggregation. In spite of the fact that sporadic and familial forms of ALS share many common patho-physiological features, the mechanistic relationship between SOD1-associated and sporadic forms of the disease if any, is not well understood. To better understand any molecular connections, a cell-based protein folding assay was employed to screen a whole genome RNAi library for genes that regulate levels of soluble SOD1. Statistically significant hits that modulate SOD1 levels, when analyzed by pathway analysis revealed a highly ranked network containing TAR DNA binging protein (TDP-43), a major component of aggregates characteristic of sporadic ALS. Biochemical experiments confirmed the action of TDP-43 on SOD1. These results highlight an unexpected relationship between TDP-43 and SOD1 which may have implications in disease pathogenesis

Social Media, Gender and the Mediatisation of War: Exploring the German Armed Forces’ Visual Representation of the Afghanistan Operation on Facebook

Studies on the mediatisation of war point to attempts of governments to regulate the visual perspective of their involvements in armed conflict – the most notable example being the practice of ‘embedded reporting’ in Iraq and Afghanistan. This paper focuses on a different strategy of visual meaning-making, namely, the publication of images on social media by armed forces themselves. Specifically, we argue that the mediatisation of war literature could profit from an increased engagement with feminist research, both within Critical Security/Critical Military Studies and within Science and Technology Studies that highlight the close connection between masculinity, technology and control. The article examines the German military mission in Afghanistan as represented on the German armed forces’ official Facebook page. Germany constitutes an interesting, and largely neglected, case for the growing literature on the mediatisation of war: its strong antimilitarist political culture makes the representation of war particularly delicate. The paper examines specific representational patterns of Germany’s involvement in Afghanistan and discusses the implications which arise from what is placed inside the frame of visibility and what remains out of its view

Epigallocatechin-3-gallate: a useful, effective and safe clinical approach for targeted prevention and individualised treatment of neurological diseases?

Neurodegenerative disorders show an increasing prevalence in a number of highly developed countries. Often, these diseases require life-long treatment mostly with drugs which are costly and mostly accompanied by more or less serious side-effects. Their heterogeneous manifestation, severity and outcome pose the need for individualised treatment options. There is an intensive search for new strategies not only for treating but also for preventing these diseases. Green tea and green tea extracts seem to be such a promising and safe alternative. However, data regarding the beneficial effects and possible underlying mechanism, specifically in clinical trials, are rare and rather controversial or non-conclusive. This review outlines the existing evidence from preclinical studies (cell and tissue cultures and animal models) and clinical trials regarding preventive and therapeutic effects of epigallcatechin-3-gallate in neurodegenerative diseases and considers antioxidative vs. pro-oxidative properties of the tea catechin important for dosage recommendations

Impact of comorbid conditions on asthmatic adults and children

Comorbid conditions (comorbidities) can complicate the diagnosis and management of asthma. In different age groups, comorbid conditions can present varying challenges, including diagnostic confusion due to mimicking asthma symptoms, exacerbation of asthma symptoms, therapy for comorbid conditions affecting asthma or therapy for asthma affecting these conditions. This review aims to summarise some common comorbid conditions with asthma, such as rhinitis, vocal cord dysfunction, gastro-oesophageal reflux, psychiatric disorders, obesity and obstructive sleep apnoea, and discuss their prevalence, symptoms, diagnosis and treatment, highlighting any differences in how they impact children and adults. Overall, there is a lack of data on the impact of treating comorbid conditions on asthma outcomes and further studies are needed to guide age-appropriate asthma management in the presence of these conditions.This article is freely available via Open Access. Click on the Publisher URL to access it via the publisher's site.A.K. reports personal fees from AstraZeneca, Behring, Boehringer Ingelheim, GlaxoSmithKline, Griffols, Teva, Novartis, Novo Nordisk, Paladdin, Pfizer, Purdue, Sanofi and Trudel, outside the submitted work. D.M.G.H. reports personal fees from AstraZeneca, Chiesi and Pfizer and grants and personal fees from Boehringer Ingelheim, GlaxoSmithKline and Novartis, outside the submitted work. S.J.S. reports fees from AstraZeneca, Boehringer Ingelheim, GlaxoSmithKline, Novartis, Propeller Health, Regeneron and Sanofi, outside the submitted work all paid to the University of Colorado School of Medicinepublished version, accepted version, submitted versio