394 research outputs found
Partitioning Complex Networks via Size-constrained Clustering
The most commonly used method to tackle the graph partitioning problem in
practice is the multilevel approach. During a coarsening phase, a multilevel
graph partitioning algorithm reduces the graph size by iteratively contracting
nodes and edges until the graph is small enough to be partitioned by some other
algorithm. A partition of the input graph is then constructed by successively
transferring the solution to the next finer graph and applying a local search
algorithm to improve the current solution.
In this paper, we describe a novel approach to partition graphs effectively
especially if the networks have a highly irregular structure. More precisely,
our algorithm provides graph coarsening by iteratively contracting
size-constrained clusterings that are computed using a label propagation
algorithm. The same algorithm that provides the size-constrained clusterings
can also be used during uncoarsening as a fast and simple local search
algorithm.
Depending on the algorithm's configuration, we are able to compute partitions
of very high quality outperforming all competitors, or partitions that are
comparable to the best competitor in terms of quality, hMetis, while being
nearly an order of magnitude faster on average. The fastest configuration
partitions the largest graph available to us with 3.3 billion edges using a
single machine in about ten minutes while cutting less than half of the edges
than the fastest competitor, kMetis
An Integrative Approach to Computational Modelling of the Gene Regulatory Network Controlling Clostridium botulinum Type A1 Toxin Production
Clostridium botulinum produces botulinum neurotoxins (BoNTs), highly potent substances responsible for botulism. Currently, mathematical models of C. botulinum growth and toxigenesis are largely aimed at risk assessment and do not include explicit genetic information beyond group level but integrate many component processes, such as signalling, membrane permeability and metabolic activity. In this paper we present a scheme for modelling neurotoxin production in C. botulinum Group I type A1, based on the integration of diverse information coming from experimental results available in the literature. Experiments show that production of BoNTs depends on the growth-phase and is under the control of positive and negative regulatory elements at the intracellular level. Toxins are released as large protein complexes and are associated with non-toxic components. Here, we systematically review and integrate those regulatory elements previously described in the literature for C. botulinum Group I type A1 into a population dynamics model, to build the very first computational model of toxin production at the molecular level. We conduct a validation of our model against several items of published experimental data for different wild type and mutant strains of C. botulinum Group I type A1. The result of this process underscores the potential of mathematical modelling at the cellular level, as a means of creating opportunities in developing new strategies that could be used to prevent botulism; and potentially contribute to improved methods for the production of toxin that is used for therapeutics
Recent Advances in Graph Partitioning
We survey recent trends in practical algorithms for balanced graph
partitioning together with applications and future research directions
Transmission and lineage displacement drive rapid population genomic flux in cystic fibrosis airway infections of a Pseudomonas aeruginosa epidemic strain
Pseudomonas aeruginosa chronic infections of cystic fibrosis (CF) airways are a paradigm for within-host evolution with abundant evidence for rapid evolutionary adaptation and diversification. Recently emerged transmissible strains have spread globally, with the Liverpool Epidemic Strain (LES) the most common strain infecting the UK CF population. Previously we have shown that highly divergent lineages of LES can be found within a single infection, consistent with super-infection among a cross-sectional cohort of patients. However, despite its clinical importance, little is known about the impact of transmission on the genetic structure of these infections over time. To characterize this, we longitudinally sampled a meta-population of 15 genetic lineages within the LES over 13âmonths among seven chronically infected CF patients by genome sequencing. Comparative genome analyses of P. aeruginosa populations revealed that the presence of coexisting lineages contributed more to genetic diversity within an infection than diversification in situ. We observed rapid and substantial shifts in the relative abundance of lineages and replacement of dominant lineages, likely to represent super-infection by repeated transmissions. Lineage dynamics within patients led to rapid changes in the frequencies of mutations across suites of linked loci carried by each lineage. Many loci were associated with important infection phenotypes such as antibiotic resistance, mucoidy and quorum sensing, and were repeatedly mutated in different lineages. These findings suggest that transmission leads to rapid shifts in the genetic structure of CF infections, including in clinically important phenotypes such as antimicrobial resistance, and is likely to impede accurate diagnosis and treatment
A Distributed Multilevel Force-directed Algorithm
The wide availability of powerful and inexpensive cloud computing services
naturally motivates the study of distributed graph layout algorithms, able to
scale to very large graphs. Nowadays, to process Big Data, companies are
increasingly relying on PaaS infrastructures rather than buying and maintaining
complex and expensive hardware. So far, only a few examples of basic
force-directed algorithms that work in a distributed environment have been
described. Instead, the design of a distributed multilevel force-directed
algorithm is a much more challenging task, not yet addressed. We present the
first multilevel force-directed algorithm based on a distributed vertex-centric
paradigm, and its implementation on Giraph, a popular platform for distributed
graph algorithms. Experiments show the effectiveness and the scalability of the
approach. Using an inexpensive cloud computing service of Amazon, we draw
graphs with ten million edges in about 60 minutes.Comment: Appears in the Proceedings of the 24th International Symposium on
Graph Drawing and Network Visualization (GD 2016
Advanced Multilevel Node Separator Algorithms
A node separator of a graph is a subset S of the nodes such that removing S
and its incident edges divides the graph into two disconnected components of
about equal size. In this work, we introduce novel algorithms to find small
node separators in large graphs. With focus on solution quality, we introduce
novel flow-based local search algorithms which are integrated in a multilevel
framework. In addition, we transfer techniques successfully used in the graph
partitioning field. This includes the usage of edge ratings tailored to our
problem to guide the graph coarsening algorithm as well as highly localized
local search and iterated multilevel cycles to improve solution quality even
further. Experiments indicate that flow-based local search algorithms on its
own in a multilevel framework are already highly competitive in terms of
separator quality. Adding additional local search algorithms further improves
solution quality. Our strongest configuration almost always outperforms
competing systems while on average computing 10% and 62% smaller separators
than Metis and Scotch, respectively
Postdischarge symptoms and rehabilitation needs in survivors of COVIDâ19 infection: A crossâsectional evaluation
Background: There is currently very limited information on the nature and prevalence of postâCOVIDâ19 symptoms after hospital discharge.
Methods: A purposive sample of 100 survivors discharged from a large University hospital were assessed 4 to 8 weeks after discharge by a multidisciplinary team of rehabilitation professionals using a specialist telephone screening tool designed to capture symptoms and impact on daily life. EQâ5Dâ5L telephone version was also completed.
Results: Participants were between 29 and 71 days (mean 48 days) postdischarge from hospital. Thirtyâtwo participants required treatment in intensive care unit (ICU group) and 68 were managed in hospital wards without needing ICU care (ward group). New illnessârelated fatigue was the most common reported symptom by 72% participants in ICU group and 60.3% in ward group. The next most common symptoms were breathlessness (65.6% in ICU group and 42.6% in ward group) and psychological distress (46.9% in ICU group and 23.5% in ward group). There was a clinically significant drop in EQ5D in 68.8% in ICU group and in 45.6% in ward group.
Conclusions: This is the first study from the United Kingdom reporting on postdischarge symptoms. We recommend planning rehabilitation services to manage these symptoms appropriately and maximize the functional return of COVIDâ19 survivors
- âŠ