Search

Chronic active multiple sclerosis (MS) lesions have a rim of activated microglia/macrophages (m/M) leading to ongoing tissue damage, and thus represent a potential treatment target. Activation of this innate immune response in MS has been visualized and quantified using PET imaging with [11C]-(R)-PK11195 (PK). Accurate identification of m/M activation in chronic MS lesions requires the sensitivity to detect lower levels of activity within a small tissue volume. We assessed the ability of kinetic modeling of PK PET data to detect m/M activity in different central nervous system (CNS) tissue regions of varying sizes and in chronic MS lesions. Ten patients with MS underwent a single brain MRI and two PK PET scans 2 hours apart. Volume of interest (VOI) masks were generated for the white matter (WM), cortical gray matter (CGM), and thalamus (TH). The distribution volume (VT) was calculated with the Logan graphical method (LGM-VT) utilizing an image-derived input function (IDIF). The binding potential (BPND) was calculated with the reference Logan graphical method (RLGM) utilizing a supervised clustering algorithm (SuperPK) to determine the non-specific binding region. Masks of varying volume were created in the CNS to assess the impact of region size on the various metrics among high and low uptake regions. Chronic MS lesions were also evaluated and individual lesion masks were generated. The highest PK uptake occurred the TH and lowest within the WM, as demonstrated by the mean time activity curves. In the TH, both reference and IDIF based methods resulted in estimates that did not significantly depend on VOI size. However, in the WM, the test-retest reliability of BPND was significantly lower in the smallest VOI, compared to the estimates of LGM-VT. These observations were consistent for all chronic MS lesions examined. In this study, we demonstrate that BPND and LGM-VT are both reliable for quantifying m/M activation in regions of high uptake, however with blood input function LGM-VT is preferred to assess longitudinal m/M activation in regions of relatively low uptake, such as chronic MS lesions. [ABSTRACT FROM AUTHOR]

[11C]CURB is a novel irreversible radioligand for imaging fatty acid amide hydrolase in the human brain. In the present work, we validate an algorithm for generating parametric map images of [11C]CURB acquired with a high resolution research tomograph (HRRT) scanner. This algorithm applies the basis function method on an irreversible two-tissue compartment model (k4 = 0) with arterial input function, i.e., BAFPIC. Monte Carlo simulations are employed to assess bias and variability of the binding macroparameters (Ki and λk3) as a function of the voxel noise level and the range of basis functions. The results show that for a [11C]CURB time activity curve with noise levels corresponding to a voxel of an image acquired with the HRRT and reconstructed with the filtered back projection algorithm, the implementation of BAFPIC requires the use of a constant vascular fraction of tissue (5%) and a cutoff for slow frequencies (0.06 min-1). With these settings, BAFPIC maintains the probabilistic distributions of the binding macroparameters with approximately Gaussian shape and minimizes the bias and variability for large physiological ranges of the rate constants of [11C]CURB. BAFPIC reduces the variability of Ki to a third of that given by Patlak plot, the standard graphical method for irreversible radioligands. Application to real data demonstrated an excellent correlation between region of interest and BAFPIC parametric data and agreed with the simulations results. Therefore, BAFPIC with a constant vascular fraction can be used to generate parametric maps of [11C]CURB images acquired with an HRRT provided that the limits of the basis functions are carefully selected. [ABSTRACT FROM AUTHOR]

Background: The proposed sequential and combinatorial algorithm, suggested as a standard tool for assessing, exploring, and reporting heterogeneity in the meta-analysis, is useful but time-consuming particularly when the number of included studies is large. Metaplot is a novel graphical approach that facilitates performing sensitivity analysis to distinguish the source of substantial heterogeneity across studies with ease and speed. Method: Metaplot is a Stata module based on Stata's commands, known informally as "ado". Metaplot presents a two-way (x, y) plot in which the x-axis represents the study codes and the y-axis represents the values of I2 statistics excluding one study at a time (n-1 studies). Metaplot also produces a table in the 'Results window' of the Stata software including details such as I2 and χ2 statistics and their P-values omitting one study in each turn. Results: Metaplot allows rapid identification of studies that have a disproportionate impact on heterogeneity across studies, and communicates to what extent omission of that study may reduce the overall heterogeneity based on the I2 and χ2 statistics. Metaplot has no limitations regarding the number of studies or types of outcome data (binomial or continuous data). Conclusions: Metaplot is a simple graphical approach that gives a quick and easy identification of the studies having substantial influences on overall heterogeneity at a glance. [ABSTRACT FROM AUTHOR]

Recent high throughput omics technology has been used to assemble large biomedical omics datasets. Clustering of single omics data has proven invaluable in biomedical research. For the task of patient sub-classification, all the available omics data should be utilized combinedly rather than treating them individually. Clustering of multi-omics datasets has the potential to reveal deep insights. Here, we propose a late integration based multiobjective multi-view clustering algorithm which uses a special perturbation operator. Initially, a large number of diverse clustering solutions (called base partitionings) are generated for each omic dataset using four clustering algorithms, viz., k means, complete linkage, spectral and fast search clustering. These base partitionings of multi-omic datasets are suitably combined using a special perturbation operator. The perturbation operator uses an ensemble technique to generate new solutions from the base partitionings. The optimal combination of multiple partitioning solutions across different views is determined after optimizing the objective functions, namely conn-XB, for checking the quality of partitionings for different views, and agreement index, for checking agreement between the views. The search capability of a multiobjective simulated annealing approach, namely AMOSA is used for this purpose. Lastly, the non-dominated solutions of the different views are combined based on similarity to generate a single set of non-dominated solutions. The proposed algorithm is evaluated on 13 multi-view cancer datasets. An elaborated comparative study with several baseline methods and five state-of-the-art models is performed to show the effectiveness of the algorithm. [ABSTRACT FROM AUTHOR]

Two classical multivariate statistical problems, testing of multivariate normality and the k-sample problem, are explored by a novel analysis on several resolutions simultaneously. The presented methods do not invert any estimated covariance matrix. Thereby, the methods work in the High Dimension Low Sample Size situation, i.e. when n ≤ p. The output, a significance map, is produced by doing a one-dimensional test for all possible resolution/position pairs. The significance map shows for which resolution/position pairs the null hypothesis is rejected. For the testing of multinormality, the Anderson-Darling test is utilized to detect potential departures from multinormality at different combinations of resolutions and positions. In the k-sample case, it is tested whether k data sets can be said to originate from the same unspecified discrete or continuous multivariate distribution. This is done by testing the k vectors corresponding to the same resolution/position pair of the k different data sets through the k-sample Anderson-Darling test. Successful demonstrations of the new methodology on artificial and real data sets are presented, and a feature selection scheme is demonstrated. [ABSTRACT FROM AUTHOR]

The process of inferring parameter values from experimental data can be a cumbersome task. In addition, the collection of experimental data can be time consuming and costly. This paper covers both these issues by addressing the following question: “Which experimental outputs should be measured to ensure that unique model parameters can be calculated?”. Stated formally, we examine the topic of minimal output sets that guarantee a model’s structural identifiability. To that end, we introduce an algorithm that guides a researcher as to which model outputs to measure. Our algorithm consists of an iterative structural identifiability analysis and can determine multiple minimal output sets of a model. This choice in different output sets offers researchers flexibility during experimental design. Our method can determine minimal output sets of large differential equation models within short computational times. [ABSTRACT FROM AUTHOR]

Analysis of the large amounts of data accumulated in public databanks can facilitate a more comprehensive understanding of molecular biological processes. Community detection from molecular biological data is paramount in characterizing evolutionary and functional traits of organisms based on gene homology and co-expression, respectively. Although there are common tools to detect local communities from a large network, no toolkit exists for detecting communities that include an element of interest based on size sensitivity, i.e., functionality to obtain local communities with preferred sizes. Herein, we present the ConfeitoGUI toolkit for detecting local communities from a correlation network involving size sensitivity. We compared the toolkit with other common tools for detection in reconstructing communities of microarray experiments of mice. In the results, ConfeitoGUI was observed to be preferable for detecting communities whose sizes are similar to those of original communities compared to other common tools. By changing simple parameters representing sizes for the toolkit, a user can obtain local communities with preferred sizes, which is beneficial for further analysis of members belonging to the communities. [ABSTRACT FROM AUTHOR]

Soil CO2 emissions are regarded as one of the largest flows of the global carbon cycle and small changes in their magnitude can have a large effect on the CO2 concentration in the atmosphere. Thus, a better understanding of this attribute would enable the identification of promoters and the development of strategies to mitigate the risks of climate change. Therefore, our study aimed at using data mining techniques to predict the soil CO2 emission induced by crop management in sugarcane areas in Brazil. To do so, we used different variable selection methods (correlation, chi-square, wrapper) and classification (Decision tree, Bayesian models, neural networks, support vector machine, bagging with logistic regression), and finally we tested the efficiency of different approaches through the Receiver Operating Characteristic (ROC) curve. The original dataset consisted of 19 variables (18 independent variables and one dependent (or response) variable). The association between cover crop and minimum tillage are effective strategies to promote the mitigation of soil CO2 emissions, in which the average CO2 emissions are 63 kg ha-1 day-1. The variables soil moisture, soil temperature (Ts), rainfall, pH, and organic carbon were most frequently selected for soil CO2 emission classification using different methods for attribute selection. According to the results of the ROC curve, the best approaches for soil CO2 emission classification were the following: (I)–the Multilayer Perceptron classifier with attribute selection through the wrapper method, that presented rate of false positive of 13,50%, true positive of 94,20% area under the curve (AUC) of 89,90% (II)–the Bagging classifier with logistic regression with attribute selection through the Chi-square method, that presented rate of false positive of 13,50%, true positive of 94,20% AUC of 89,90%. However, the (I) approach stands out in relation to (II) for its higher positive class accuracy (high CO2 emission) and lower computational cost. [ABSTRACT FROM AUTHOR]

Information theory allows us to investigate information processing in neural systems in terms of information transfer, storage and modification. Especially the measure of information transfer, transfer entropy, has seen a dramatic surge of interest in neuroscience. Estimating transfer entropy from two processes requires the observation of multiple realizations of these processes to estimate associated probability density functions. To obtain these necessary observations, available estimators typically assume stationarity of processes to allow pooling of observations over time. This assumption however, is a major obstacle to the application of these estimators in neuroscience as observed processes are often non-stationary. As a solution, Gomez-Herrero and colleagues theoretically showed that the stationarity assumption may be avoided by estimating transfer entropy from an ensemble of realizations. Such an ensemble of realizations is often readily available in neuroscience experiments in the form of experimental trials. Thus, in this work we combine the ensemble method with a recently proposed transfer entropy estimator to make transfer entropy estimation applicable to non-stationary time series. We present an efficient implementation of the approach that is suitable for the increased computational demand of the ensemble method's practical application. In particular, we use a massively parallel implementation for a graphics processing unit to handle the computationally most heavy aspects of the ensemble method for transfer entropy estimation. We test the performance and robustness of our implementation on data from numerical simulations of stochastic processes. We also demonstrate the applicability of the ensemble method to magnetoencephalographic data. While we mainly evaluate the proposed method for neuroscience data, we expect it to be applicable in a variety of fields that are concerned with the analysis of information transfer in complex biological, social, and artificial systems. [ABSTRACT FROM AUTHOR]

Consumers show high interindividual variability in food liking during repeated exposure. To investigate consumer liking during repeated exposure, data is often interpreted on a product level by averaging results over all consumers. However, a single product may elicit inconsistent behaviors in consumers; averaging will mix and hide possible subgroups of consumer behaviors, leading to a misinterpretation of the results. To deal with the variability in consumer liking, we propose to use clustering on data from consumer-product combinations to investigate the nature of the behavioral differences within the complete dataset. The resulting behavioral clusters can then be used to describe product acceptance. To test this approach we used two independent data sets in which young adults were repeatedly exposed to drinks and snacks, respectively. We found that five typical consumer behaviors existed in both datasets. These behaviors differed both in the average level of liking as well as its temporal dynamics. By investigating the distribution of a single product across typical consumer behaviors, we provide more precise insight in how consumers divide in subgroups based on their product liking (i.e. product modality). This work shows that taking into account and using interindividual differences can unveil information about product acceptance that would otherwise be ignored. [ABSTRACT FROM AUTHOR]

Genomic regions participating in recombination events may support distinct topologies, and phylogenetic analyses should incorporate this heterogeneity. Existing phylogenetic methods for recombination detection are challenged by the enormous number of possible topologies, even for a moderate number of taxa. If, however, the detection analysis is conducted independently between each putative recombinant sequence and a set of reference parentals, potential recombinations between the recombinants are neglected. In this context, a recombination hotspot can be inferred in phylogenetic analyses if we observe several consecutive breakpoints. We developed a distance measure between unrooted topologies that closely resembles the number of recombinations. By introducing a prior distribution on these recombination distances, a Bayesian hierarchical model was devised to detect phylogenetic inconsistencies occurring due to recombinations. This model relaxes the assumption of known parental sequences, still common in HIV analysis, allowing the entire dataset to be analyzed at once. On simulated datasets with up to 16 taxa, our method correctly detected recombination breakpoints and the number of recombination events for each breakpoint. The procedure is robust to rate and transition:transversion heterogeneities for simulations with and without recombination. This recombination distance is related to recombination hotspots. Applying this procedure to a genomic HIV-1 dataset, we found evidence for hotspots and de novo recombination. [ABSTRACT FROM AUTHOR]