Classification and Segmentation of MRI Brain Images using Support Vector Machine and Fuzzy C-means Clustering

An early diagnosis of brain disorders is very important for timely treatment of such diseases.Several imaging modalities are used to capture the anomalities by obtaining either the  physiological or morphological information. The scans obtained using imaging modalities such as magnetic resonance imaging (MRI) are investigated by the radiologists in order to diagnose the diseases. However such investigations are time consuming and might involve errors. In this paper, a fuzzy c-means clustering method is used for brain MRI image segmentation.The GLCM features are obtained from the segmented images and are subsequently mapped in to a PCA space. A support vector machine (SVM) classifier is used to classify brain MRI images taken from BRATS-13 images. The method is evaluated by employing various performance measures such as  Jaccard index, Dice index, mean square error (MSE), peak signal to noise ratio (PSNR). The results show that the method outperforms the existing methods

Cell-Free Extract Data Variability Reduction in the Presence of Structural Non-Identifiability

The bottom up design of genetic circuits to control cellular behavior is one of the central objectives within Synthetic Biology. Performing design iterations on these circuits in vivo is often a time consuming process, which has led to E. coli cell extracts to be used as simplified circuit prototyping environments. Cell extracts, however, display large batch-to-batch variability in gene expression. In this paper, we develop the theoretical groundwork for a model based calibration methodology for correcting this variability. We also look at the interaction of this methodology with the phenomenon of parameter (structural) non-identifiability, which occurs when the parameter identification inverse problem has multiple solutions. In particular, we show that under certain consistency conditions on the sets of output-indistinguishable parameters, data variability reduction can still be performed, and when the parameter sets have a certain structural feature called covariation, our methodology may be modified in a particular way to still achieve the desired variability reduction

Modeling, Computation, and Characterization to Accelerate the Development of Synthetic Gene Circuits in Cell-Free Extracts

Synthetic biology may be defined as an attempt at using engineering principles to design and build novel biological functionalities. An important class of such functionalities involves the bottom up design of genetic networks (or 'circuits') to control cellular behavior. Performing design iterations on these circuits in vivo is often a time consuming process. One approach that has been developed to address these long design times is to use E. coli cell extracts as simplified circuit prototyping environments. The analogy with similar approaches in engineering, such as prototyping using wind tunnels and breadboards, may be extended by developing accompanying computer aided design tools. In this thesis, we discuss the development of computational and mathematical tools to accelerate circuit prototyping in the TX-TL cell free prototyping platform, and demonstrate some applications of these tools. We start by discussing the problem of reducing circuit behavior variability between different batches of TX-TL cell extracts. To this end, we demonstrate a model-based methodology for calibrating extract batches, and for using the calibrations to 'correct' the behavior of genetic circuits between batches. We also look at the interaction of this methodology with the phenomenon of parameter non-identifiability, which occurs when the parameter identification inverse problem has multiple solutions. In particular, we derive conditions under which parameter non-identifiability does not hinder our modeling objectives, and subsequently demonstrate the use of such non-identifiable models in performing data variability reduction. Next, we describe txtlsim, a MATLAB Simbiology based toolbox for automatically generating models of genetic circuits in TX-TL, and for using these models for part characterization and circuit behavior prediction. Large genetic circuits can have non-negligible resource usage needs, leading to unintended interactions between circuit nodes arising due to the loading of cellular machinery, transcription factors or other regulatory elements. The usage of consumable resources like nucleotides and amino acids can also have non-trivial effects on complex genetic circuits. These types of effects are handled by the modeling framework of txtlsim in a natural way. We also highlight mcmc-simbio, a smaller toolbox within txtlsim for performing concurrent Bayesian parameter inference on Simbiology models. Concurrent inference here means that a common set of parameters can be identified using data from an ensemble of different circuits and experiments, with each experiment informing a subset of the parameters. The combination of the concurrence feature with the fact that Markov chain Monte Carlo based Bayesian inference methods allow for the direct visualization of parameter non-identifiability enables the design of ensembles of experiments that reduce such non-identifiability. Finally, we end with a method for performing model order reduction on transcription and translation elongation models while maintaining the ability of these models to track resource consumption. We show that due to their network topology, our models cannot be brought into the two-timescale form of singular perturbation theory when written in species concentration coordinates. We identify a coordinate system in which singular perturbation theory may be applied to chemical reaction networks more naturally, and use this to achieve the desired model reduction.</p

Finding stationary solutions to the chemical master equation by gluing state spaces at one or two states recursively

Noise is indispensible to key cellular activities, including gene expression coordination and probabilistic differentiation. Stochastic models, such as the chemical master equation (CME), are essential to model noise in the levels of cellular components. In the CME framework, each state is associated with the molecular counts of all component species, and specifies the probability for the system to have that set of molecular counts. Analytic solutions to the CME are rarely known but can bring exciting benefits. For instance, simulations of biochemical reaction networks that are multiscale in time can be sped up tremendously by incorporating analytic solutions of the slow time-scale dynamics. Analytic solutions also enable the design of stationary distributions with properties such as the modality of the distribution, the mean expression level, and the level of noise. One way to derive the analytic steady state response of a biochemical reaction network was recently proposed by (Mélykúti et al. 2014). The paper recursively glues simple state spaces together, for which we have analytic solutions, at one or two states. In this work, we explore the benefits and limitations of the gluing technique proposed by Mélykúti et al., and introduce recursive algorithms that use the technique to solve for the analytic steady state response of stochastic biochemical reaction networks. We give formal characterizations of the set of reaction networks whose state spaces can be obtained by carrying out single-point gluing of paths, cycles or both sequentially. We find that the dimension of the state space of a reaction network equals the maximum number of linearly independent reactions in the system. We then characterize the complete set of stochastic biochemical reaction networks that have elementary reactions and two-dimensional state spaces. As an example, we propose a recursive algorithm that uses the gluing technique to solve for the steady state response of a mass-conserving system with two connected monomolecular reversible reactions. Even though the gluing technique can only construct finite state spaces, we find that, by taking the size of a finite state space to infinity, the steady state response can converge to the analytic solution on the resulting infinite state space. Finally, we illustrate the aforementioned ideas with the example of two interconnected transcriptional components, which was first studied by (Ghaemi and Del Vecchio 2012)

Recursively constructing analytic expressions for equilibrium distributions of stochastic biochemical reaction networks

Noise is often indispensable to key cellular activities, such as gene expression, necessitating the use of stochastic models to capture its dynamics. The chemical master equation (CME) is a commonly used stochastic model of Kolmogorov forward equations that describe how the probability distribution of a chemically reacting system varies with time. Finding analytic solutions to the CME can have benefits, such as expediting simulations of multiscale biochemical reaction networks and aiding the design of distributional responses. However, analytic solutions are rarely known. A recent method of computing analytic stationary solutions relies on gluing simple state spaces together recursively at one or two states. We explore the capabilities of this method and introduce algorithms to derive analytic stationary solutions to the CME. We first formally characterize state spaces that can be constructed by performing single-state gluing of paths, cycles or both sequentially. We then study stochastic biochemical reaction networks that consist of reversible, elementary reactions with two-dimensional state spaces. We also discuss extending the method to infinite state spaces and designing the stationary behaviour of stochastic biochemical reaction networks. Finally, we illustrate the aforementioned ideas using examples that include two interconnected transcriptional components and biochemical reactions with two-dimensional state spaces

Rapidly Characterizing the Fast Dynamics of RNA Genetic Circuitry with Cell-Free Transcription Translation (TX-TL) Systems

RNA regulators are emerging as powerful tools to engineer synthetic genetic networks or rewire existing ones. A potential strength of RNA networks is that they may be able to propagate signals on time scales that are set by the fast degradation rates of RNAs. However, a current bottleneck to verifying this potential is the slow design-build-test cycle of evaluating these networks in vivo. Here, we adapt an Escherichia coli-based cell-free transcription-translation (TX-TL) system for rapidly prototyping RNA networks. We used this system to measure the response time of an RNA transcription cascade to be approximately five minutes per step of the cascade. We also show that this response time can be adjusted with temperature and regulator threshold tuning. Finally, we use TX-TL to prototype a new RNA network, an RNA single input module, and show that this network temporally stages the expression of two genes in vivo

Case Reports1. A Late Presentation of Loeys-Dietz Syndrome: Beware of TGFβ Receptor Mutations in Benign Joint Hypermobility

Background: Thoracic aortic aneurysms (TAA) and dissections are not uncommon causes of sudden death in young adults. Loeys-Dietz syndrome (LDS) is a rare, recently described, autosomal dominant, connective tissue disease characterized by aggressive arterial aneurysms, resulting from mutations in the transforming growth factor beta (TGFβ) receptor genes TGFBR1 and TGFBR2. Mean age at death is 26.1 years, most often due to aortic dissection. We report an unusually late presentation of LDS, diagnosed following elective surgery in a female with a long history of joint hypermobility. Methods: A 51-year-old Caucasian lady complained of chest pain and headache following a dural leak from spinal anaesthesia for an elective ankle arthroscopy. CT scan and echocardiography demonstrated a dilated aortic root and significant aortic regurgitation. MRA demonstrated aortic tortuosity, an infrarenal aortic aneurysm and aneurysms in the left renal and right internal mammary arteries. She underwent aortic root repair and aortic valve replacement. She had a background of long-standing joint pains secondary to hypermobility, easy bruising, unusual fracture susceptibility and mild bronchiectasis. She had one healthy child age 32, after which she suffered a uterine prolapse. Examination revealed mild Marfanoid features. Uvula, skin and ophthalmological examination was normal. Results: Fibrillin-1 testing for Marfan syndrome (MFS) was negative. Detection of a c.1270G > C (p.Gly424Arg) TGFBR2 mutation confirmed the diagnosis of LDS. Losartan was started for vascular protection. Conclusions: LDS is a severe inherited vasculopathy that usually presents in childhood. It is characterized by aortic root dilatation and ascending aneurysms. There is a higher risk of aortic dissection compared with MFS. Clinical features overlap with MFS and Ehlers Danlos syndrome Type IV, but differentiating dysmorphogenic features include ocular hypertelorism, bifid uvula and cleft palate. Echocardiography and MRA or CT scanning from head to pelvis is recommended to establish the extent of vascular involvement. Management involves early surgical intervention, including early valve-sparing aortic root replacement, genetic counselling and close monitoring in pregnancy. Despite being caused by loss of function mutations in either TGFβ receptor, paradoxical activation of TGFβ signalling is seen, suggesting that TGFβ antagonism may confer disease modifying effects similar to those observed in MFS. TGFβ antagonism can be achieved with angiotensin antagonists, such as Losartan, which is able to delay aortic aneurysm development in preclinical models and in patients with MFS. Our case emphasizes the importance of timely recognition of vasculopathy syndromes in patients with hypermobility and the need for early surgical intervention. It also highlights their heterogeneity and the potential for late presentation. Disclosures: The authors have declared no conflicts of interes