Constructing continuum many countable, primitive, unbalanced digraphs

AbstractWe construct continuum many non-isomorphic countable digraphs which are highly arc transitive, have finite out-valency and infinite in-valency, and whose automorphism groups are primitive

Rubisco is evolving for improved catalytic efficiency and CO2 assimilation in plants

Rubisco is the primary entry point for carbon into the biosphere. However, rubisco is widely regarded as inefficient leading many to question whether the enzyme can adapt to become a better catalyst. Through a phylogenetic investigation of the molecular and kinetic evolution of Form I rubisco we uncover the evolutionary trajectory of rubisco kinetic evolution in angiosperms. We show that rbcL is among the 1% of slowest-evolving genes and enzymes on Earth, accumulating one nucleotide substitution every 0.9 My and one amino acid mutation every 7.2 My. Despite this, rubisco catalysis has been continually evolving toward improved CO2/O2 specificity, carboxylase turnover, and carboxylation efficiency. Consistent with this kinetic adaptation, increased rubisco evolution has led to a concomitant improvement in leaf-level CO2 assimilation. Thus, rubisco has been slowly but continually evolving toward improved catalytic efficiency and CO2 assimilation in plants

Infinite primitive and distance transitive directed graphs of finite out-valency

We give certain properties which are satisfied by the descendant set of a vertex in an infinite, primitive, distance transitive digraph of finite out-valency and provide a strong structure theory for digraphs satisfying these properties. In particular, we show that there are only countably many possibilities for the isomorphism type of such a descendant set, thereby confirming a conjecture of the first Author. As a partial converse, we show that certain related conditions on a countable digraph are sufficient for it to occur as the descendant set of a primitive, distance transitive digraph

Transcriptomic responses of mixed cultures of ascomycete fungi to lignocellulose using dual RNA-seq reveal inter-species antagonism and limited beneficial effects on CAZyme expression

Gaining new knowledge through fungal monoculture responses to lignocellulose is a widely used approach that can lead to better cocktails for lignocellulose saccharification (the enzymatic release of sugars which are subsequently used to make biofuels). However, responses in lignocellulose mixed cultures are rarely studied in the same detail even though in nature fungi often degrade lignocellulose as mixed communities. Using a dual RNA-seq approach, we describe the first study of the transcriptional responses of wild-type strains of Aspergillus niger, Trichoderma reesei and Penicillium chrysogenum in two and three mixed species shake-flask cultures with wheat straw. Based on quantification of species-specific rRNA, a set of conditions was identified where mixed cultures could be sampled so as to obtain sufficient RNA-seq reads for analysis from each species. The number of differentially-expressed genes varied from a couple of thousand to fewer than one hundred. The proportion of carbohydrate active enzyme (CAZy) encoding transcripts was lower in the majority of the mixed cultures compared to the respective straw monocultures. A small subset of P. chrysogenum CAZy genes showed five to ten-fold significantly increased transcript abundance in a two-species mixed culture with T. reesei. However, a substantial number of T. reesei CAZy transcripts showed reduced abundance in mixed cultures. The highly induced genes in mixed cultures indicated that fungal antagonism was a major part of the mixed cultures. In line with this, secondary metabolite producing gene clusters showed increased transcript abundance in mixed cultures and also mixed cultures with T. reesei led to a decrease in the mycelial biomass of A. niger. Significantly higher monomeric sugar release from straw was only measured using a minority of the mixed culture filtrates and there was no overall improvement. This study demonstrates fungal interaction with changes in transcripts, enzyme activities and biomass in the mixed cultures and whilst there were minor beneficial effects for CAZy transcripts and activities, the competitive interaction between T. reesei and the other fungi was the most prominent feature of this study

Intraperitoneal drain placement and outcomes after elective colorectal surgery: international matched, prospective, cohort study

Despite current guidelines, intraperitoneal drain placement after elective colorectal surgery remains widespread. Drains were not associated with earlier detection of intraperitoneal collections, but were associated with prolonged hospital stay and increased risk of surgical-site infections.Background Many surgeons routinely place intraperitoneal drains after elective colorectal surgery. However, enhanced recovery after surgery guidelines recommend against their routine use owing to a lack of clear clinical benefit. This study aimed to describe international variation in intraperitoneal drain placement and the safety of this practice. Methods COMPASS (COMPlicAted intra-abdominal collectionS after colorectal Surgery) was a prospective, international, cohort study which enrolled consecutive adults undergoing elective colorectal surgery (February to March 2020). The primary outcome was the rate of intraperitoneal drain placement. Secondary outcomes included: rate and time to diagnosis of postoperative intraperitoneal collections; rate of surgical site infections (SSIs); time to discharge; and 30-day major postoperative complications (Clavien-Dindo grade at least III). After propensity score matching, multivariable logistic regression and Cox proportional hazards regression were used to estimate the independent association of the secondary outcomes with drain placement. Results Overall, 1805 patients from 22 countries were included (798 women, 44.2 per cent; median age 67.0 years). The drain insertion rate was 51.9 per cent (937 patients). After matching, drains were not associated with reduced rates (odds ratio (OR) 1.33, 95 per cent c.i. 0.79 to 2.23; P = 0.287) or earlier detection (hazard ratio (HR) 0.87, 0.33 to 2.31; P = 0.780) of collections. Although not associated with worse major postoperative complications (OR 1.09, 0.68 to 1.75; P = 0.709), drains were associated with delayed hospital discharge (HR 0.58, 0.52 to 0.66; P < 0.001) and an increased risk of SSIs (OR 2.47, 1.50 to 4.05; P < 0.001). Conclusion Intraperitoneal drain placement after elective colorectal surgery is not associated with earlier detection of postoperative collections, but prolongs hospital stay and increases SSI risk

Effects of fluoxetine on functional outcomes after acute stroke (FOCUS): a pragmatic, double-blind, randomised, controlled trial

Background Results of small trials indicate that fluoxetine might improve functional outcomes after stroke. The FOCUS trial aimed to provide a precise estimate of these effects. Methods FOCUS was a pragmatic, multicentre, parallel group, double-blind, randomised, placebo-controlled trial done at 103 hospitals in the UK. Patients were eligible if they were aged 18 years or older, had a clinical stroke diagnosis, were enrolled and randomly assigned between 2 days and 15 days after onset, and had focal neurological deficits. Patients were randomly allocated fluoxetine 20 mg or matching placebo orally once daily for 6 months via a web-based system by use of a minimisation algorithm. The primary outcome was functional status, measured with the modified Rankin Scale (mRS), at 6 months. Patients, carers, health-care staff, and the trial team were masked to treatment allocation. Functional status was assessed at 6 months and 12 months after randomisation. Patients were analysed according to their treatment allocation. This trial is registered with the ISRCTN registry, number ISRCTN83290762. Findings Between Sept 10, 2012, and March 31, 2017, 3127 patients were recruited. 1564 patients were allocated fluoxetine and 1563 allocated placebo. mRS data at 6 months were available for 1553 (99·3%) patients in each treatment group. The distribution across mRS categories at 6 months was similar in the fluoxetine and placebo groups (common odds ratio adjusted for minimisation variables 0·951 [95% CI 0·839–1·079]; p=0·439). Patients allocated fluoxetine were less likely than those allocated placebo to develop new depression by 6 months (210 [13·43%] patients vs 269 [17·21%]; difference 3·78% [95% CI 1·26–6·30]; p=0·0033), but they had more bone fractures (45 [2·88%] vs 23 [1·47%]; difference 1·41% [95% CI 0·38–2·43]; p=0·0070). There were no significant differences in any other event at 6 or 12 months. Interpretation Fluoxetine 20 mg given daily for 6 months after acute stroke does not seem to improve functional outcomes. Although the treatment reduced the occurrence of depression, it increased the frequency of bone fractures. These results do not support the routine use of fluoxetine either for the prevention of post-stroke depression or to promote recovery of function. Funding UK Stroke Association and NIHR Health Technology Assessment Programme

Dimethyl fumarate in patients admitted to hospital with COVID-19 (RECOVERY): a randomised, controlled, open-label, platform trial

Dimethyl fumarate (DMF) inhibits inflammasome-mediated inflammation and has been proposed as a treatment for patients hospitalised with COVID-19. This randomised, controlled, open-label platform trial (Randomised Evaluation of COVID-19 Therapy [RECOVERY]), is assessing multiple treatments in patients hospitalised for COVID-19 (NCT04381936, ISRCTN50189673). In this assessment of DMF performed at 27 UK hospitals, adults were randomly allocated (1:1) to either usual standard of care alone or usual standard of care plus DMF. The primary outcome was clinical status on day 5 measured on a seven-point ordinal scale. Secondary outcomes were time to sustained improvement in clinical status, time to discharge, day 5 peripheral blood oxygenation, day 5 C-reactive protein, and improvement in day 10 clinical status. Between 2 March 2021 and 18 November 2021, 713 patients were enroled in the DMF evaluation, of whom 356 were randomly allocated to receive usual care plus DMF, and 357 to usual care alone. 95% of patients received corticosteroids as part of routine care. There was no evidence of a beneficial effect of DMF on clinical status at day 5 (common odds ratio of unfavourable outcome 1.12; 95% CI 0.86-1.47; p = 0.40). There was no significant effect of DMF on any secondary outcome

Analysis of Graph Structure Using Quantum Walks

This thesis considers the use of the quantum walk for graph-based pattern recognition tasks. The main contributions are algorithms for: i) lifting cospectrality of graphs, ii) exact and inexact graph matching, iii) calculating graphs distances, and iv) embedding graphs. Since graphs are widely used to represent structured data, graph analysis algorithms form the basis of numerous solutions to pattern recognition problems. As such, good, error-tolerant graph analysis algorithms are a necessity. Random walks on graphs, both quantum and cla:ssical, are important tools because, while based on local connectivity structure, they capture global properties of the graphs being studied. While the use of the classical random walk for graph analysis has been studied, the use of the 'quantum walk has not. This thesis investigates the possibilities it offers. Chapter 2 of this thesis surveys the literature relating to graph analysis. Particular attention is paid to spectral and random walk based approaches. An overview of quantum computing and the qu~ntum walk is then given. In Chapter 3 we present a novel matrix representation for graphs. The spectrum of this II,latrix can be calculated in polynomial time and is able to distinguish between graphs for which there is no other sub-exponential time algorithm proven to be able to distinguish between them. 'rVe perform experiments on sets of strongly regular graphs, bipartite incidence graphs of balanced incomplete block designs and 3-level regular graphs. Such graphs form hard classes for any graph isomorphism algorithm. 'rVe also compare the performance of the spectrum of this new matrix representation with the performance of standard spectral methods. on large numbers of trees and regular graphs, graphs which are often encountered in real-world graph analysis problems. In all cases it significantly outperforms standard methods. Additionally, we use distances .... obtained from its spectrum to cluster graphs derived from real-world images. Thus, we provide a' spectr,al representation of graphs that can be used in place of standard spectral representations and which is far less prone to cospectrality. In Chapters 4 and 5 we present a graph structure that allows graph matching to be carried out by way of quantum interference between the walks on a pair of graphs of potentially different sizes. 'Interference amplitudes' between the walks are used as vertex-vertex assignment costs and the match is completed using the Hungarian algorithm. vVe also provide a method for further improving the match by rewarding edge-consistent assignments. vVe investigate the use of both discrete and continuous time quantum walks and carry out a comparative analysis. Using synthetic graphs with structural errors,' we show that it outperforms Umeyama's algorithm. We also propose a distance measure for graphs based on the interference amplitudes and show it can be used to successfully cluster Delaunay triangulations of images. In Chapter 6 we present an analysis of the commute time of the continuous-time quantum walk on a graph. For the classical random walk the commute time has been shown to be robust to errors in connectivity structure and to lead to spectral clustering algorithms with improved performance. vVe show how the commute time of the continuous-time quantum walk can be calculated and provide an analysis with reference to its classical counterpart. Experimentally, we show that the graph embedding that preserves the quantum commute-time is less prone to uni-dimensionality than the classical commute-time embedding and can be used to emphasise cluster structure. In Chapter 7 we present the conclusions that we draw from our work and areas which we believe merit further investigation. In summary, the work presented in this thesis demonstrates that quantum walks can be used to construct effective graph analysis algorithms. Furthermore, we have used such algorithms to provide solutions to problems where classical app'roaches have failed.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Data from: Independent and parallel evolution of new genes by gene duplication in two origins of C4 photosynthesis provides new insight into the mechanism of phloem loading in C4 species

C4 photosynthesis is considered one of the most remarkable examples of evolutionary convergence in eukaryotes. However, it is unknown whether the evolution of C4 photosynthesis required the evolution of new genes. Genome-wide gene-tree species-tree reconciliation of seven monocot species that span two origins of C4 photosynthesis revealed that there was significant parallelism in the duplication and retention of genes coincident with the evolution of C4 photosynthesis in these lineages. Specifically, 21 orthologous genes were duplicated and retained independently in parallel at both C4 origins. Analysis of this gene cohort revealed that the set of parallel duplicated and retained genes is enriched for genes that are preferentially expressed in bundle sheath cells, the cell type in which photosynthesis was activated during C4 evolution. Furthermore, functional analysis of the cohort of parallel duplicated genes identified SWEET-13 as a potential key transporter in the evolution of C4 photosynthesis in grasses, and provides new insight into the mechanism of phloem loading in these C4 species