Search

Many results have been obtained when studying scientific papers citations databases in a network perspective. Articles can be ranked according to their current in-degree and their future popularity or citation counts can even be predicted. The dynamical properties of such networks and the observation of the time evolution of their nodes started more recently. This work adopts an evolutionary perspective and proposes an original algorithm for the construction of genealogical trees of scientific papers on the basis of their citation count evolution in time. The fitness of a paper now amounts to its in-degree growing trend and a “dying” paper will suddenly see this trend declining in time. It will give birth and be taken over by some of its most prevalent citing “offspring”. Practically, this might be used to trace the successive published milestones of a research field. [ABSTRACT FROM AUTHOR]

Data analysis for flow-based in-vitro receptomics array, like a tongue-on-a-chip, is complicated by the relatively large variability within and between arrays, transfected DNA types, spots, and cells within spots. Simply averaging responses of spots of the same type would lead to high variances and low statistical power. This paper presents an approach based on linear mixed models, allowing a quantitative and robust comparison of complex samples and indicating which receptors are responsible for any differences. These models are easily extended to take into account additional effects such as the build-up of cell stress and to combine data from replicated experiments. The increased analytical power this brings to receptomics research is discussed. [ABSTRACT FROM AUTHOR]

Type 2 diabetes leads to premature death and reduced quality of life for 8% of Americans. Nutrition management is critical to maintaining glycemic control, yet it is difficult to achieve due to the high individual differences in glycemic response to nutrition. Anticipating glycemic impact of different meals can be challenging not only for individuals with diabetes, but also for expert diabetes educators. Personalized computational models that can accurately forecast an impact of a given meal on an individual’s blood glucose levels can serve as the engine for a new generation of decision support tools for individuals with diabetes. However, to be useful in practice, these computational engines need to generate accurate forecasts based on limited datasets consistent with typical self-monitoring practices of individuals with type 2 diabetes. This paper uses three forecasting machines: (i) data assimilation, a technique borrowed from atmospheric physics and engineering that uses Bayesian modeling to infuse data with human knowledge represented in a mechanistic model, to generate real-time, personalized, adaptable glucose forecasts; (ii) model averaging of data assimilation output; and (iii) dynamical Gaussian process model regression. The proposed data assimilation machine, the primary focus of the paper, uses a modified dual unscented Kalman filter to estimate states and parameters, personalizing the mechanistic models. Model selection is used to make a personalized model selection for the individual and their measurement characteristics. The data assimilation forecasts are empirically evaluated against actual postprandial glucose measurements captured by individuals with type 2 diabetes, and against predictions generated by experienced diabetes educators after reviewing a set of historical nutritional records and glucose measurements for the same individual. The evaluation suggests that the data assimilation forecasts compare well with specific glucose measurements and match or exceed in accuracy expert forecasts. We conclude by examining ways to present predictions as forecast-derived range quantities and evaluate the comparative advantages of these ranges. [ABSTRACT FROM AUTHOR]

Methods have been developed for Mendelian randomization that can obtain consistent causal estimates under weaker assumptions than the standard instrumental variable assumptions. The median-based estimator and MR-Egger are examples of such methods. However, these methods can be sensitive to genetic variants with heterogeneous causal estimates. Such heterogeneity may arise from over-dispersion in the causal estimates, or specific variants with outlying causal estimates. In this paper, we develop three extensions to robust methods for Mendelian randomization with summarized data: 1) robust regression (MM-estimation); 2) penalized weights; and 3) Lasso penalization. Methods using these approaches are considered in two applied examples: one where there is evidence of over-dispersion in the causal estimates (the causal effect of body mass index on schizophrenia risk), and the other containing outliers (the causal effect of low-density lipoprotein cholesterol on Alzheimer’s disease risk). Through an extensive simulation study, we demonstrate that robust regression applied to the inverse-variance weighted method with penalized weights is a worthwhile additional sensitivity analysis for Mendelian randomization to provide robustness to variants with outlying causal estimates. The results from the applied examples and simulation study highlight the importance of using methods that make different assumptions to assess the robustness of findings from Mendelian randomization investigations with multiple genetic variants. [ABSTRACT FROM AUTHOR]

This paper is concerned with the potential multistability of protein concentrations in the cell. That is, situations where one, or a family of, proteins may sit at one of two or more different steady state concentrations in otherwise identical cells, and in spite of them being in the same environment. For models of multisite protein phosphorylation for example, in the presence of excess substrate, it has been shown that the achievable number of stable steady states can increase linearly with the number of phosphosites available. In this paper, we analyse the consequences of adding enzyme docking to these and similar models, with the resultant sequestration of phosphatase and kinase by the fully unphosphorylated and by the fully phosphorylated substrates respectively. In the large molecule numbers limit, where deterministic analysis is applicable, we prove that there are always values for these rates of sequestration which, when exceeded, limit the extent of multistability. For the models considered here, these numbers are much smaller than the affinity of the enzymes to the substrate when it is in a modifiable state. As substrate enzyme-sequestration is increased, we further prove that the number of steady states will inevitably be reduced to one. For smaller molecule numbers a stochastic analysis is more appropriate, where multistability in the large molecule numbers limit can manifest itself as multimodality of the probability distribution; the system spending periods of time in the vicinity of one mode before jumping to another. Here, we find that substrate enzyme sequestration can induce bimodality even in systems where only a single steady state can exist at large numbers. To facilitate this analysis, we develop a weakly chained diagonally dominant M-matrix formulation of the Chemical Master Equation, allowing greater insights in the way particular mechanisms, like enzyme sequestration, can shape probability distributions and therefore exhibit different behaviour across different regimes. [ABSTRACT FROM AUTHOR]

A significant approach for the discovery of biological regulatory rules of genes, protein and their inheritance relationships is the extraction of meaningful patterns from biological sequence data. The existing algorithms of sequence pattern discovery, like MSPM and FBSB, suffice their low efficiency and accuracy. In order to deal with this issue, this paper presents a new algorithm for biological sequence pattern mining abbreviated MpBsmi based on the data index structure. The MpBsmi algorithm employs a sequence position table abbreviated ST and a sequence database index structure named DB-Index for data storing, mining and pattern expansion. The ST and DB-Index of single items are firstly obtained through scanning sequence database once. Then a new algorithm for fast support counting is developed to mine the table ST to identify the frequent single items. Based on a connection strategy, the frequent patterns are expanded and the expanded table ST is updated by scanning the DB-Index. The fast support counting algorithm is used for obtaining the frequent expansion patterns. Finally, a new pruning technique is developed for extended pattern to avoid the generation of unnecessarily large number of candidate patterns. The experiments results on multiple classical protein sequences from the Pfam database validate the performance of the proposed algorithm including the accuracy, stability and scalability. It is showed that the proposed algorithm has achieved the better space efficiency, stability and scalability comparing with MSPM, FBSB which are the two main algorithms for biological sequence mining. [ABSTRACT FROM AUTHOR]

The selection of seismic attributes is a key process in reservoir prediction because the prediction accuracy relies on the reliability and credibility of the seismic attributes. However, effective selection method for useful seismic attributes is still a challenge. This paper presents a novel selection method of seismic attributes for reservoir prediction based on the gray relational degree (GRD) and support vector machine (SVM). The proposed method has a two-hierarchical structure. In the first hierarchy, the primary selection of seismic attributes is achieved by calculating the GRD between seismic attributes and reservoir parameters, and the GRD between the seismic attributes. The principle of the primary selection is that these seismic attributes with higher GRD to the reservoir parameters will have smaller GRD between themselves as compared to those with lower GRD to the reservoir parameters. Then the SVM is employed in the second hierarchy to perform an interactive error verification using training samples for the purpose of determining the final seismic attributes. A real-world case study was conducted to evaluate the proposed GRD-SVM method. Reliable seismic attributes were selected to predict the coalbed methane (CBM) content in southern Qinshui basin, China. In the analysis, the instantaneous amplitude, instantaneous bandwidth, instantaneous frequency, and minimum negative curvature were selected, and the predicted CBM content was fundamentally consistent with the measured CBM content. This real-world case study demonstrates that the proposed method is able to effectively select seismic attributes, and improve the prediction accuracy. Thus, the proposed GRD-SVM method can be used for the selection of seismic attributes in practice. [ABSTRACT FROM AUTHOR]

Background and aims: Persistent intestinal damage is associated with higher complication rates in celiac disease. We aimed to assess the potential modifiers of mucosal recovery. Materials and methods: We screened databases (PubMed, Embase, Cochrane Trials, and Web of Science) for papers on celiac disease. Papers discussing (1) celiac patients (2) follow-up biopsy and (3) mucosal recovery after commencement of a gluten-free diet were included. The primary outcome was to produce a comprehensive analysis of complete mucosal recovery (i.e., Marsh 0 on follow-up). We compared children’s recovery ratios to those of adults. Patients following a strict gluten-free dietary regimen were included in a subgroup. Summary point estimates, 95% confidence intervals (CIs), and 95% predictive intervals (PIs) were calculated. Heterogeneity was tested with I2-statistic. The PROSPERO registration number is CRD42016053482. Results: The overall complete mucosal recovery ratio, calculated from 37 observational studies, was 0.36 (CI: 0.28–0.44, PI: -0.12–0.84; I2: 98.4%, p<0.01). Children showed higher complete mucosal recovery ratio than adults (p<0.01): 0.65 (CI: 0.44–0.85, PI: -0.10–1.39; I2: 96.5%, p<0.01) as opposed to 0.24 (CI: 0.15–0.33, PI: -0.19–1.08; I2: 96.3%, p<0.01). In the strict dietary adherence subgroup, complete mucosal recovery ratio was 0.47 (CI: 0.24–0.70, PI: -0.47–1.41; I2: 98.8%, p<0.001). On meta-regression, diagnostic villous atrophy (Marsh 3) ratio (-8.97, p<0.01) and male ratio (+6.04, p<0.01) proved to be a significant determinant of complete mucosal recovery, unlike duration of gluten-free diet (+0.01, p = 0.62). The correlation between complete mucosal recovery ratio and age on diagnosis is of borderline significance (-0.03, p = 0.05). Conclusions: There is considerable heterogeneity across studies concerning complete mucosal recovery ratios achieved by a gluten-free diet in celiac disease. Several celiac patients fail to achieve complete mucosal recovery even if a strict dietary regimen is followed. Younger age on diagnosis, less severe initial histologic damage and male gender predispose for achieving mucosal recovery. [ABSTRACT FROM AUTHOR]

Customized buses (CBs) are a new mode of public transportation and an important part of diversified public transportation, providing advanced, attractive and user-led service. The operational activity of a CB is planned by aggregating space–time demand and similar passenger travel demands. Based on an analysis of domestic and international research and the current development of CBs in China and considering passenger travel data, this paper studies the problems associated with the operation of CBs, such as stop selection, line planning and timetables, and establishes a model for the stop planning and timetables of CBs. The improved immune genetic algorithm (IIGA) is used to solve the model with regard to the following: 1) multiple population design and transport operator design, 2) memory library design, 3) mutation probability design and crossover probability design, and 4) the fitness calculation of the gene segment. Finally, a real-world example in Beijing is calculated, and the model and solution results are verified and analyzed. The results illustrate that the IIGA solves the model and is superior to the basic genetic algorithm in terms of the number of passengers, travel time, average passenger travel time, average passenger arrival time ahead of schedule and total line revenue. This study covers the key issues involving operational systems of CBs, combines theoretical research and empirical analysis, and provides a theoretical foundation for the planning and operation of CBs. [ABSTRACT FROM AUTHOR]

Background: Numerous factor analytic studies consistently support a distinction between two symptom domains of attention-deficit/hyperactivity disorder (ADHD), inattention and hyperactivity/impulsivity. Both dimensions show high internal consistency and moderate to strong correlations with each other. However, it is not clear what drives this strong correlation. The aim of this paper is to address this issue. Method: We applied a sophisticated approach for causal discovery on three independent data sets of scores of the two ADHD dimensions in NeuroIMAGE (total N = 675), ADHD-200 (N = 245), and IMpACT (N = 164), assessed by different raters and instruments, and further used information on gender or a genetic risk haplotype. Results: In all data sets we found strong statistical evidence for the same pattern: the clear dependence between hyperactivity/impulsivity symptom level and an established genetic factor (either gender or risk haplotype) vanishes when one conditions upon inattention symptom level. Under reasonable assumptions, e.g., that phenotypes do not cause genotypes, a causal model that is consistent with this pattern contains a causal path from inattention to hyperactivity/impulsivity. Conclusions: The robust dependency cancellation observed in three different data sets suggests that inattention is a driving factor for hyperactivity/impulsivity. This causal hypothesis can be further validated in intervention studies. Our model suggests that interventions that affect inattention will also have an effect on the level of hyperactivity/impulsivity. On the other hand, interventions that affect hyperactivity/impulsivity would not change the level of inattention. This causal model may explain earlier findings on heritable factors causing ADHD reported in the study of twins with learning difficulties. [ABSTRACT FROM AUTHOR]

Background: To allow early diagnosis and monitoring of disease progression, there is a need for biomarkers in amyotrophic lateral sclerosis (ALS). Neurofilaments (NF) are emerging protein biomarkers in other neurological diseases, and are of possible use in ALS. Objective: The aim of this study is to evaluate the utility of NF levels as blood or cerebrospinal fluid (CSF) biomarker in patients with ALS. Methods: A systematic search of Pubmed, Embase and Scopus was performed. Methodological quality assessment was applied to refine the final search results. Meta-analysis of the data was performed. Results: Level of NF heavy chain and light chains were significantly elevated in the CSF of ALS patients compared to healthy controls/controls without parenchymal central nervous system (CNS) involvement and ALS mimic disease patients. NF light chain level in CSF was higher in ALS patients than in neurological patients with CNS involvement (SMD = 1.352, P = 0.01). NF light chain concentration in blood was higher in ALS patients than healthy controls/controls without CNS involvement (SMD = 1.448, P<0.0001). NF heavy chain levels in CSF were negatively correlated disease duration and ALSFRS-R ((r = -0.447, P<0.0001; r = -0.486, P<0.0001). NF light chain levels in CSF were negatively correlated with disease duration (r = -0.273, P = 0.011). Conclusion: NF heavy and light chain levels have potential use as a marker of neural degeneration in ALS, but are not specific for the disease, and are more likely to be used as measures of disease progression. [ABSTRACT FROM AUTHOR]

Background: Identifying conserved regions in protein sequences is a fundamental operation, occurring in numerous sequence-driven analysis pipelines. It is used as a way to decode domain-rich regions within proteins, to compute protein clusters, to annotate sequence function, and to compute evolutionary relationships among protein sequences. A number of approaches exist for identifying and characterizing protein families based on their domains, and because domains represent conserved portions of a protein sequence, the primary computation involved in protein family characterization is identification of such conserved regions. However, identifying conserved regions from large collections (millions) of protein sequences presents significant challenges. Methods: In this paper we present a new, alignment-free method for detecting conserved regions in protein sequences called NADDA (No-Alignment Domain Detection Algorithm). Our method exploits the abundance of exact matching short subsequences (k-mers) to quickly detect conserved regions, and the power of machine learning is used to improve the prediction accuracy of detection. We present a parallel implementation of NADDA using the MapReduce framework and show that our method is highly scalable. Results: We have compared NADDA with Pfam and InterPro databases. For known domains annotated by Pfam, accuracy is 83%, sensitivity 96%, and specificity 44%. For sequences with new domains not present in the training set an average accuracy of 63% is achieved when compared to Pfam. A boost in results in comparison with InterPro demonstrates the ability of NADDA to capture conserved regions beyond those present in Pfam. We have also compared NADDA with ADDA and MKDOM2, assuming Pfam as ground-truth. On average NADDA shows comparable accuracy, more balanced sensitivity and specificity, and being alignment-free, is significantly faster. Excluding the one-time cost of training, runtimes on a single processor were 49s, 10,566s, and 456s for NADDA, ADDA, and MKDOM2, respectively, for a data set comprised of approximately 2500 sequences. [ABSTRACT FROM AUTHOR]

In this paper we apply machine learning methods for predicting protein interactions in fungal secretion pathways. We assume an inter-species transfer setting, where training data is obtained from a single species and the objective is to predict protein interactions in other, related species. In our methodology, we combine several state of the art machine learning approaches, namely, multiple kernel learning (MKL), pairwise kernels and kernelized structured output prediction in the supervised graph inference framework. For MKL, we apply recently proposed centered kernel alignment and p-norm path following approaches to integrate several feature sets describing the proteins, demonstrating improved performance. For graph inference, we apply input-output kernel regression (IOKR) in supervised and semi-supervised modes as well as output kernel trees (OK3). In our experiments simulating increasing genetic distance, Input-Output Kernel Regression proved to be the most robust prediction approach. We also show that the MKL approaches improve the predictions compared to uniform combination of the kernels. We evaluate the methods on the task of predicting protein-protein-interactions in the secretion pathways in fungi, S.cerevisiae, baker’s yeast, being the source, T. reesei being the target of the inter-species transfer learning. We identify completely novel candidate secretion proteins conserved in filamentous fungi. These proteins could contribute to their unique secretion capabilities. [ABSTRACT FROM AUTHOR]

Background: There is no point of care diagnostic test for infection with M. Leprae or for leprosy, although ELISA anti PGL-1 has been considered and sometimes used as a means to identify infection. Methods: A systematic review of all cohort studies, which classified healthy leprosy contacts, at entry, according to anti-PGL1 positivity, and had at least one year follow up. The outcome was clinical diagnosis of leprosy by an experienced physician. The meta-analysis used a fixed model to estimated OR for the association of PGL-1 positivity and clinical leprosy. A fixed model also estimated the sensibility of PGL-1 positivity and positive predictive value. Results: Contacts who were anti PGL-1 positive at baseline were 3 times as likely to develop leprosy; the proportion of cases of leprosy that were PGL-1 positive at baseline varied but was always under 50%. Conclusions: Although there is a clear and consistent association between positivity to anti PGL-1 and development of leprosy in healthy contacts, selection of contacts for prophylaxis based on anti PGL1 response would miss more than half future leprosy cases. Should chemoprophylaxis of controls be incorporated into leprosy control programmes, PGL1 appears not to be a useful test in the decision of which contacts should receive chemoprophylaxis. [ABSTRACT FROM AUTHOR]

The aim of this paper is to provide a Bayesian formulation of the so-called magnitude-based inference approach to quantifying and interpreting effects, and in a case study example provide accurate probabilistic statements that correspond to the intended magnitude-based inferences. The model is described in the context of a published small-scale athlete study which employed a magnitude-based inference approach to compare the effect of two altitude training regimens (live high-train low (LHTL), and intermittent hypoxic exposure (IHE)) on running performance and blood measurements of elite triathletes. The posterior distributions, and corresponding point and interval estimates, for the parameters and associated effects and comparisons of interest, were estimated using Markov chain Monte Carlo simulations. The Bayesian analysis was shown to provide more direct probabilistic comparisons of treatments and able to identify small effects of interest. The approach avoided asymptotic assumptions and overcame issues such as multiple testing. Bayesian analysis of unscaled effects showed a probability of 0.96 that LHTL yields a substantially greater increase in hemoglobin mass than IHE, a 0.93 probability of a substantially greater improvement in running economy and a greater than 0.96 probability that both IHE and LHTL yield a substantially greater improvement in maximum blood lactate concentration compared to a Placebo. The conclusions are consistent with those obtained using a ‘magnitude-based inference’ approach that has been promoted in the field. The paper demonstrates that a fully Bayesian analysis is a simple and effective way of analysing small effects, providing a rich set of results that are straightforward to interpret in terms of probabilistic statements. [ABSTRACT FROM AUTHOR]

Information transmission in cells occurs quite accurately even when concentration changes are “read” by individual binding sites. In this paper we study ligand number and site occupancy fluctuations when ligands diffuse and react going beyond the analyses that focus on their asymptotic decay. In this way we show that, for immobile binding sites, fluctuations in the number of bound molecules decay on a relatively fast scale before the asymptotic behavior kicks in. This result can explain the observed co-existence of highly fluctuating instantaneous transcriptional activities with accumulated mRNA concentrations that have relatively small noise levels. We also show that the initial stages of the decay in the bound molecule number fluctuations have one or two characteristic timescales depending on the concentration of free molecules. This transition can explain the changes in enzyme activity observed at the single molecule level. [ABSTRACT FROM AUTHOR]

Objective: Systematic Review was used to evaluate the efficacy and safety of Dalfampridine (DAP) in the treatment of Mobility Disability (MS) in patients with Multiple Sclerosis. Methods: Clinical randomized controlled studies about DAP and placebo in the treatment of Mobility Disability in patients with Multiple Sclerosis until March 2019 were explored by searching Embase, PubMed, Cochrane, Web of Knowledge, and ClinicalTrials.gov. Literature screening, data extraction, quality assessment, and statistical analysis were performed by using Stata 14.0. Results: 10 papers were included in the meta-analysis, and the number of patients was 2100. In conclusion, the application of DAP in clinical can significantly improve the Mobility Disability of patients [OR = 2.73, 95%CI (1.66, 4.50), P<0.001, I2 = 74.1%] and boost the mobility speed of patients in Timing 24 Minute Walk Test (T24FW) [SMD = 3,08, 95%CI(1,58, 4.58), P<0.001, I2 = 98.7%]. There are no significant differences of the incidence of adverse events [RR = 1.06, 95%CI (0.99, 1.14), P = 0.928, I2 = 0.0%] and urinary tract infection [RR = 1.21, 95%CI(0.91, 1.60), P = 0.145, I2 = 37.2%] between the DAP test group (Doses≤10 mg) and the placebo control group, and the incidence of adverse events [RR = 1.14, 95%CI(1.02, 1.28), P = 0.793, I2 = 0.0%] and urinary tract infection[RR = 3.05, 95%CI(1.04, 8.99), P = 0.680, I2 = 0.0%] for the DAP test group (Doses>10 mg) is a litter higher than the placebo control group. Conclusion: DAP can effectively improve Mobility Disability in patients with Multiple Sclerosis, which is safe and reliable in specific DAP usage doses. [ABSTRACT FROM AUTHOR]

Due to the fast speed of data generation and collection from advanced equipment, the amount of data obviously overflows the limit of available memory space and causes difficulties achieving high learning accuracy. Several methods based on discard-after-learn concept have been proposed. Some methods were designed to cope with a single incoming datum but some were designed for a chunk of incoming data. Although the results of these approaches are rather impressive, most of them are based on temporally adding more neurons to learn new incoming data without any neuron merging process which can obviously increase the computational time and space complexities. Only online versatile elliptic basis function (VEBF) introduced neuron merging to reduce the space-time complexity of learning only a single incoming datum. This paper proposed a method for further enhancing the capability of discard-after-learn concept for streaming data-chunk environment in terms of low computational time and neural space complexities. A set of recursive functions for computing the relevant parameters of a new neuron, based on statistical confidence interval, was introduced. The newly proposed method, named streaming chunk incremental learning (SCIL), increases the plasticity and the adaptabilty of the network structure according to the distribution of incoming data and their classes. When being compared to the others in incremental-like manner, based on 11 benchmarked data sets of 150 to 581,012 samples with attributes ranging from 4 to 1,558 formed as streaming data, the proposed SCIL gave better accuracy and time in most data sets. [ABSTRACT FROM AUTHOR]

Cells and organisms have developed homeostatic mechanisms which protect them against a changing environment. How growth and homeostasis interact is still not well understood, but of increasing interest to the molecular and synthetic biology community to recognize and design control circuits which can oppose the diluting effects of cell growth. In this paper we describe the performance of selected negative feedback controllers in response to different applied growth laws and time dependent outflow perturbations of a controlled variable. The approach taken here is based on deterministic mass action kinetics assuming that cell content is instantaneously mixed. All controllers behave ideal in the sense that they for step-wise perturbations in volume and a controlled compound A are able to drive A precisely back to the controllers’ theoretical set-points. The applied growth kinetics reflect experimentally observed growth laws, which range from surface to volume ratio growth to linear and exponential growth. Our results show that the kinetic implementation of integral control and the structure of the negative feedback loop are two properties which affect controller performance. Best performance is observed for controllers based on derepression kinetics and controllers with an autocatalytic implementation of integral control. Both are able to defend exponential growth and perturbations, although the autocatalytic controller shows an offset from its theoretical set-point. Controllers with activating signaling using zero-order or bimolecular (antithetic) kinetics for integral control behave very similar but less well. Their performance can be improved by implementing negative feedback structures having repression/derepression steps or by increasing controller aggressiveness. Our results provide a guide what type of feedback structures and integral control kinetics are suitable to oppose the dilution effects by different growth laws and time dependent perturbations on a deterministic level. [ABSTRACT FROM AUTHOR]

Profilin 1 (PFN1) protein plays key roles in neuronal growth and differentiation, membrane trafficking, and regulation of the actin cytoskeleton. Four natural variants of PFN1 were described as related to ALS, the most common adult-onset motor neuron disorder. However, the pathological mechanism of PFN1 in ALS is not yet completely understood. The goal of this work is to thoroughly analyze the effects of the ALS-related mutations on PFN1 structure and function using computational simulations. Here, PhD-SNP, PMUT, PolyPhen-2, SIFT, SNAP, SNPS&GO, SAAP, nsSNPAnalyzer, SNPeffect4.0 and I-Mutant2.0 were used to predict the functional and stability effects of PFN1 mutations. ConSurf was used for the evolutionary conservation analysis, and GROMACS was used to perform the MD simulations. The mutations C71G, M114T, and G118V, but not E117G, were predicted as deleterious by most of the functional prediction algorithms that were used. The stability prediction indicated that the ALS-related mutations could destabilize PFN1. The ConSurf analysis indicated that the mutation C71G, M114T, E117G, and G118V occur in highly conserved positions. The MD results indicated that the studied mutations could affect the PFN1 flexibility at the actin and PLP-binding domains, and consequently, their intermolecular interactions. It may be therefore related to the functional impairment of PFN1 upon C71G, M114T, E117G and G118V mutations, and their involvement in ALS development. We also developed a database, SNPMOL (), containing the results presented on this paper for biologists and clinicians to exploit PFN1 and its natural variants. [ABSTRACT FROM AUTHOR]

A number of recent studies have shown that cell shape and cytoskeletal texture can be used as sensitive readouts of the physiological state of the cell. However, utilization of this information requires the development of quantitative measures that can describe relevant aspects of cell shape. In this paper we develop a toolbox, TISMorph, that calculates a set of quantitative measures to address this need. Some of the measures introduced here have been used previously, while others are new and have desirable properties for shape and texture quantification of cells. These measures, broadly classifiable into the categories of textural, irregularity and spreading measures, are tested by using them to discriminate between osteosarcoma cell lines treated with different cytoskeletal drugs. We find that even though specific classification tasks often rely on a few measures, these are not the same between all classification tasks, thus requiring the use of the entire suite of measures for classification and discrimination. We provide detailed descriptions of the measures, as well as the TISMorph package to implement them. Quantitative morphological measures that capture different aspects of cell morphology will help enhance large-scale image-based quantitative analysis, which is emerging as a new field of biological data. [ABSTRACT FROM AUTHOR]

Control problem in a biological system is the problem of finding an interventional policy for changing the state of the biological system from an undesirable state, e.g. disease, into a desirable healthy state. Boolean networks are utilized as a mathematical model for gene regulatory networks. This paper provides an algorithm to solve the control problem in Boolean networks. The proposed algorithm is implemented and applied on two biological systems: T-cell receptor network and Drosophila melanogaster network. Results show that the proposed algorithm works faster in solving the control problem over these networks, while having similar accuracy, in comparison to previous exact methods. Source code and a simple web service of the proposed algorithm is available at . [ABSTRACT FROM AUTHOR]

This study aimed to analyse microstructure data on the density and orientation of collagen fibrils in whole eye globes and to propose an effective method for the preparation of data for use in numerical simulations of the eye’s biomechanical performance. Wide-angle X-ray scattering was applied to seven healthy ex-vivo human eyes. Each eye was dissected into an anterior and a posterior cup, and radial incisions were used to flatten the tissue before microstructure characterisation. A method was developed to use the microstructure data obtained for the dissected tissue to build realistic 3D maps of fibril density and orientation covering the whole eye globe. At the central cornea, 61.5±2.3% of fibrils were aligned within 45° sectors surrounding the two orthogonal directions. In contrast, more than one-third of the total fibril content was concentrated along the circumferential direction at the limbus (37.0±2.4%) and around the optic nerve head (34.8±2.1%). The insertion locations of the four recti muscles exhibited a preference in the meridional direction near the equator (38.6±3.9%). There was also a significant difference in fibril density between the limbus and other regions (ratio = 1.91±0.45, p <0.01 at the central cornea and ratio = 0.80±0.21, p <0.01 at the posterior pole). Characterisation of collagen fibril density and orientation across the whole ocular surface has been possible but required the use of a technique that involved tissue dissection and hence caused tissue damage. The method presented in this paper aimed to minimise the effect of dissection on the quality of obtained data and was successful in identifying fibril distribution trends that were compatible with earlier studies, which concentrated on localised areas of the ocular globe. [ABSTRACT FROM AUTHOR]

Diabetic peripheral neuropathy (DPN), the most common chronic complication of diabetes, has become an important public health crisis worldwide. Given that DPN is extremely difficult to treat, determining its risk factors and controlling it at an early stage is critical to preventing its serious consequences and the burden of social disease. Current studies suggest that the risk factors for diabetic peripheral neuropathy are the duration of diabetes, age, glycosylated hemoglobin A1c (HbA1c), diabetic retinopathy (DR), smoking, and body mass Index (BMI). However, most of the aforementioned studies are cross-sectional, and the sample sizes are very limited, so the strength of causal reasoning is relatively low. The current study systematically evaluated DPN’s influencing factors in patients with type 2 diabetes using evidence-based medicine. Overall, 16 included studies (14 cross-sectional studies and 2 case-control studies including 12,116 cases) that conformed to the present criteria were included in the final analysis. The results suggested that the duration of diabetes (MD 2.5, 95% CI 1.71~3.29), age (MD 4.00, 95% CI 3.05~4.95), HbA1c (MD 0.48, 95% CI 0.33~0.64), and DR (OR 2.34, 95% CI 1.74~3.16) are associated with significantly increased risks of DPN among diabetic patients, while BMI, smoking, total triglyceride (TG), and total cholesterol (TC) did not indicate any risks of increasing DPN. The findings provide a scientific basis for a further understanding of the causes of type 2 diabetes complicated with peripheral neuropathy and the improvement of preventive strategies. The next step is to conduct further high-quality prospective cohort studies to validate this paper’s findings. [ABSTRACT FROM AUTHOR]

The paper presents the results of studies related to the impact of functional additives in the form of polylactide (PLA), polyvinyl alcohol (PVA), and keratin hydrolysate (K) on the physical characteristics of biopolymer foils. TPS granulate was obtained using a TS-45 single-screw extruder with L/D = 16. Foil was produced with the use of an L/D = 36 extruder with film-blowing section. The impact of the quantity and type of the functional additives on the processing efficiency and energy consumption of granulate extrusion, as well as the physical characteristics of the foil produced: thickness, basis weight, and colour were determined. By measuring the FTIR spectra it was determined the type and origin of the respective functional groups. It was observed that foils produced from granulates with the addition of 3% PVA were characterised by the lowest thickness and basis weight. Addition of 2 and 3% of PLA increased thickness and basis weight of starch-based foils significantly. Increasing the content of keratin in SG/K samples resulted in a decrease of brightness and intensify the yellow tint of foils, especially when 2 and 3% of keratin was used. In terms of the other samples, it was observed that the colour remained almost unchanged irrespective of the percentage content of the additive used. Infrared analyses conducted on foil containing PVA, PLA, and K revealed a change in spectra intensity in the frequency range associated with–OH groups originating from the forming free, intra- and intermolecular hydrogen bonds. Based on an analysis of the respective bands within the IR range it was also concluded that considerable structural changes took place with respect to the glycosidic bonds of starch itself. The application of the mentioned additives had a significant structural impact on the produced starch-based foils. Furthermore, the conducted UV-Vis analyses revealed a substantial increase in absorbance and a related reduction of the permeability (colour change) of the obtained materials in the range of ultraviolet and visible light. [ABSTRACT FROM AUTHOR]

We generalize the notion of λ-superstrings, presented in a previous paper, to the notion of weighted λ-superstrings. This generalization entails an important improvement in the applications to vaccine designs, as it allows epitopes to be weighted by their immunogenicities. Motivated by these potential applications of constructing short weighted λ-superstrings to vaccine design, we approach this problem in two ways. First, we formalize the problem as a combinatorial optimization problem (in fact, as two polynomially equivalent problems) and develop an integer programming (IP) formulation for solving it optimally. Second, we describe a model that also takes into account good pairwise alignments of the obtained superstring with the input strings, and present a genetic algorithm that solves the problem approximately. We apply both algorithms to a set of 169 strings corresponding to the Nef protein taken from patiens infected with HIV-1. In the IP-based algorithm, we take the epitopes and the estimation of the immunogenicities from databases of experimental epitopes. In the genetic algorithm we take as candidate epitopes all 9-mers present in the 169 strings and estimate their immunogenicities using a public bioinformatics tool. Finally, we used several bioinformatic tools to evaluate the properties of the candidates generated by our method, which indicated that we can score high immunogenic λ-superstrings that at the same time present similar conformations to the Nef virus proteins. [ABSTRACT FROM AUTHOR]

LncRNA-protein interactions play important roles in post-transcriptional gene regulation, poly-adenylation, splicing and translation. Identification of lncRNA-protein interactions helps to understand lncRNA-related activities. Existing computational methods utilize multiple lncRNA features or multiple protein features to predict lncRNA-protein interactions, but features are not available for all lncRNAs or proteins; most of existing methods are not capable of predicting interacting proteins (or lncRNAs) for new lncRNAs (or proteins), which don’t have known interactions. In this paper, we propose the sequence-based feature projection ensemble learning method, “SFPEL-LPI”, to predict lncRNA-protein interactions. First, SFPEL-LPI extracts lncRNA sequence-based features and protein sequence-based features. Second, SFPEL-LPI calculates multiple lncRNA-lncRNA similarities and protein-protein similarities by using lncRNA sequences, protein sequences and known lncRNA-protein interactions. Then, SFPEL-LPI combines multiple similarities and multiple features with a feature projection ensemble learning frame. In computational experiments, SFPEL-LPI accurately predicts lncRNA-protein associations and outperforms other state-of-the-art methods. More importantly, SFPEL-LPI can be applied to new lncRNAs (or proteins). The case studies demonstrate that our method can find out novel lncRNA-protein interactions, which are confirmed by literature. Finally, we construct a user-friendly web server, available at . [ABSTRACT FROM AUTHOR]

RNA SHAPE experiments have become important and successful sources of information for RNA structure prediction. In such experiments, chemical reagents are used to probe RNA backbone flexibility at the nucleotide level, which in turn provides information on base pairing and therefore secondary structure. Little is known, however, about the statistics of such SHAPE data. In this work, we explore different representations of noise in SHAPE data and propose a statistically sound framework for extracting reliable reactivity information from multiple SHAPE replicates. Our analyses of RNA SHAPE experiments underscore that a normal noise model is not adequate to represent their data. We propose instead a log-normal representation of noise and discuss its relevance. Under this assumption, we observe that processing simulated SHAPE data by directly averaging different replicates leads to bias. Such bias can be reduced by analyzing the data following a log transformation, either by log-averaging or Kalman filtering. Application of Kalman filtering has the additional advantage that a prior on the nucleotide reactivities can be introduced. We show that the performance of Kalman filtering is then directly dependent on the quality of that prior. We conclude the paper with guidelines on signal processing of RNA SHAPE data. [ABSTRACT FROM AUTHOR]

Patient reported outcome measures (PROMs) become increasingly important for assessing the effectiveness of a drug or medical device. In order for a PROM to be claimed in labeling, the PROM has to be valid, reliable and able to detect a change if the targeted disease status changes. One approach to assess the quality of a patient reported outcome measure (PROM) is to investigate the association between the PROM and an objective clinical endpoint measuring the status of a disease/condition. However, methods assessing the association between continuous and discrete variables are limited, especially for correlated measurements. In this paper, we propose a method to assess such association with any type of samples with or without correlation. The method involves estimating the probability revealing the status of a subject’s disease/condition (called truth thereafter) through the subject’s reported outcomes. The probability is a conditional probability revealing truth given the relative location of the subject’s objective outcome compared to the subject-specific latent threshold in the objective endpoint. A consistent estimator for the probability is derived. The operating characteristics of the consistent estimator are illustrated using simulation. Our method is applied to hypothetical clinical trial data generated for an ophthalmic device as an illustration. [ABSTRACT FROM AUTHOR]

B cells develop high affinity receptors during the course of affinity maturation, a cyclic process of mutation and selection. At the end of affinity maturation, a number of cells sharing the same ancestor (i.e. in the same “clonal family”) are released from the germinal center; their amino acid frequency profile reflects the allowed and disallowed substitutions at each position. These clonal-family-specific frequency profiles, called “substitution profiles”, are useful for studying the course of affinity maturation as well as for antibody engineering purposes. However, most often only a single sequence is recovered from each clonal family in a sequencing experiment, making it impossible to construct a clonal-family-specific substitution profile. Given the public release of many high-quality large B cell receptor datasets, one may ask whether it is possible to use such data in a prediction model for clonal-family-specific substitution profiles. In this paper, we present the method “Substitution Profiles Using Related Families” (SPURF), a penalized tensor regression framework that integrates information from a rich assemblage of datasets to predict the clonal-family-specific substitution profile for any single input sequence. Using this framework, we show that substitution profiles from similar clonal families can be leveraged together with simulated substitution profiles and germline gene sequence information to improve prediction. We fit this model on a large public dataset and validate the robustness of our approach on two external datasets. Furthermore, we provide a command-line tool in an open-source software package () implementing these ideas and providing easy prediction using our pre-fit models. [ABSTRACT FROM AUTHOR]

In the human retina, rod and cone cells detect incoming light with a molecule called rhodopsin. After rhodopsin molecules are activated (by photon impact), these molecules activate the rest of the signalling process for a brief period of time until they are deactivated by a multistage process. First, active rhodopsin is phosphorylated multiple times. Following this, they are further inhibited by the binding of molecules called arrestins. Finally, they decay into opsins. The time required for each of these stages becomes progressively longer, and each stage further reduces the activity of rhodopsin. However, while this deactivation process itself is well researched, the roles of the above stages in signal (and image) processing are poorly understood. In this paper, we will show that the activity of rhodopsin molecules during the deactivation process can be described as the fractional integration of an incoming signal. Furthermore, we show how this affects an image; specifically, the effect of fractional integration in video and signal processing and how it reduces noise and the improves adaptability under different lighting conditions. Our experimental results provide a better understanding of vertebrate and human vision, and why the rods and cones of the retina differ from the light detectors in cameras. [ABSTRACT FROM AUTHOR]

Structural information related to protein–peptide complexes can be very useful for novel drug discovery and design. The computational docking of protein and peptide can supplement the structural information available on protein–peptide interactions explored by experimental ways. Protein–peptide docking of this paper can be described as three processes that occur in parallel: ab-initio peptide folding, peptide docking with its receptor, and refinement of some flexible areas of the receptor as the peptide is approaching. Several existing methods have been used to sample the degrees of freedom in the three processes, which are usually triggered in an organized sequential scheme. In this paper, we proposed a parallel approach that combines all the three processes during the docking of a folding peptide with a flexible receptor. This approach mimics the actual protein–peptide docking process in parallel way, and is expected to deliver better performance than sequential approaches. We used 22 unbound protein–peptide docking examples to evaluate our method. Our analysis of the results showed that the explicit refinement of the flexible areas of the receptor facilitated more accurate modeling of the interfaces of the complexes, while combining all of the moves in parallel helped the constructing of energy funnels for predictions. [ABSTRACT FROM AUTHOR]

In this paper, we describe SAFlex (Structural Alphabet Flexibility), an extension of an existing structural alphabet (HMM-SA), to better explore increasing protein three dimensional structure information by encoding conformations of proteins in case of missing residues or uncertainties. An SA aims to reduce three dimensional conformations of proteins as well as their analysis and comparison complexity by simplifying any conformation in a series of structural letters. Our methodology presents several novelties. Firstly, it can account for the encoding uncertainty by providing a wide range of encoding options: the maximum a posteriori, the marginal posterior distribution, and the effective number of letters at each given position. Secondly, our new algorithm deals with the missing data in the protein structure files (concerning more than 75% of the proteins from the Protein Data Bank) in a rigorous probabilistic framework. Thirdly, SAFlex is able to encode and to build a consensus encoding from different replicates of a single protein such as several homomer chains. This allows localizing structural differences between different chains and detecting structural variability, which is essential for protein flexibility identification. These improvements are illustrated on different proteins, such as the crystal structure of an eukaryotic small heat shock protein. They are promising to explore increasing protein redundancy data and obtain useful quantification of their flexibility. [ABSTRACT FROM AUTHOR]

Co-evolution between pairs of residues in a multiple sequence alignment (MSA) of homologous proteins has long been proposed as an indicator of structural contacts. Recently, several methods, such as direct-coupling analysis (DCA) and MetaPSICOV, have been shown to achieve impressive rates of contact prediction by taking advantage of considerable sequence data. In this paper, we show that prediction success rates are highly sensitive to the structural definition of a contact, with more permissive definitions (i.e., those classifying more pairs as true contacts) naturally leading to higher positive predictive rates, but at the expense of the amount of structural information contributed by each contact. Thus, the remaining limitations of contact prediction algorithms are most noticeable in conjunction with geometrically restrictive contacts—precisely those that contribute more information in structure prediction. We suggest that to improve prediction rates for such “informative” contacts one could combine co-evolution scores with additional indicators of contact likelihood. Specifically, we find that when a pair of co-varying positions in an MSA is occupied by residue pairs with favorable statistical contact energies, that pair is more likely to represent a true contact. We show that combining a contact potential metric with DCA or MetaPSICOV performs considerably better than DCA or MetaPSICOV alone, respectively. This is true regardless of contact definition, but especially true for stricter and more informative contact definitions. In summary, this work outlines some remaining challenges to be addressed in contact prediction and proposes and validates a promising direction towards improvement. [ABSTRACT FROM AUTHOR]

Essential proteins are crucial to living cells. Identification of essential proteins from protein-protein interaction (PPI) networks can be applied to pathway analysis and function prediction, furthermore, it can contribute to disease diagnosis and drug design. There have been some experimental and computational methods designed to identify essential proteins, however, the prediction precision remains to be improved. In this paper, we propose a new method for identifying essential proteins based on Participation degree of a protein in protein Complexes and Subgraph Density, named as PCSD. In order to test the performance of PCSD, four PPI datasets (DIP, Krogan, MIPS and Gavin) are used to conduct experiments. The experiment results have demonstrated that PCSD achieves a better performance for predicting essential proteins compared with some competing methods including DC, SC, EC, IC, LAC, NC, WDC, PeC, UDoNC, and compared with the most recent method LBCC, PCSD can correctly predict more essential proteins from certain numbers of top ranked proteins on the DIP dataset, which indicates that PCSD is very effective in discovering essential proteins in most case. [ABSTRACT FROM AUTHOR]

The localization (or polarization) of proteins on the membrane during the mating of budding yeast (Saccharomyces cerevisiae) is an important model system for understanding simple pattern formation within cells. While there are many existing mathematical models of polarization, for both budding and mating, there are still many aspects of this process that are not well understood. In this paper we set out to elucidate the effect that the geometry of the cell can have on the dynamics of certain models of polarization. Specifically, we look at several spatial stochastic models of Cdc42 polarization that have been adapted from published models, on a variety of tip-shaped geometries, to replicate the shape change that occurs during the growth of the mating projection. We show here that there is a complex interplay between the dynamics of polarization and the shape of the cell. Our results show that while models of polarization can generate a stable polarization cap, its localization at the tip of mating projections is unstable, with the polarization cap drifting away from the tip of the projection in a geometry dependent manner. We also compare predictions from our computational results to experiments that observe cells with projections of varying lengths, and track the stability of the polarization cap. Lastly, we examine one model of actin polarization and show that it is unlikely, at least for the models studied here, that actin dynamics and vesicle traffic are able to overcome this effect of geometry. [ABSTRACT FROM AUTHOR]

The query-template alignment of proteins is one of the most critical steps of template-based modeling methods used to predict the 3D structure of a query protein. This alignment can be interpreted as a temporal classification or structured prediction task and first order Conditional Random Fields have been proposed for protein alignment and proven to be rather successful. Some other popular structured prediction problems, such as speech or image classification, have gained from the use of higher order Conditional Random Fields due to the well known higher order correlations that exist between their labels and features. In this paper, we propose and describe the use of higher order Conditional Random Fields for query-template protein alignment. The experiments carried out on different public datasets validate our proposal, especially on distantly-related protein pairs which are the most difficult to align. [ABSTRACT FROM AUTHOR]

The Glycoside Hydrolase Family 13 (GH13) is both evolutionarily diverse and relevant to many industrial applications. Its members hydrolyze starch into smaller carbohydrates and members of the family have been bioengineered to improve catalytic function under industrial environments. We introduce a framework to analyze the response to selection of GH13 protein structures given some phylogenetic and simulated dynamic information. We find that the TIM-barrel (a conserved protein fold consisting of eight α-helices and eight parallel β-strands that alternate along the peptide backbone, common to all amylases) is not selectable since it is under purifying selection. We also show a method to rank important residues with higher inferred response to selection. These residues can be altered to effect change in properties. In this work, we define fitness as inferred thermodynamic stability. We show that under the developed framework, residues 112Y, 122K, 124D, 125W, and 126P are good candidates to increase the stability of the truncated α-amylase protein from Geobacillus thermoleovorans (PDB code: 4E2O; α-1,4-glucan-4-glucanohydrolase; EC 3.2.1.1). Overall, this paper demonstrates the feasibility of a framework for the analysis of protein structures for any other fitness landscape. [ABSTRACT FROM AUTHOR]

Combining different metabolomics platforms can contribute significantly to the discovery of complementary processes expressed under different conditions. However, analysing the fused data might be hampered by the difference in their quality. In metabolomics data, one often observes that measurement errors increase with increasing measurement level and that different platforms have different measurement error variance. In this paper we compare three different approaches to correct for the measurement error heterogeneity, by transformation of the raw data, by weighted filtering before modelling and by a modelling approach using a weighted sum of residuals. For an illustration of these different approaches we analyse data from healthy obese and diabetic obese individuals, obtained from two metabolomics platforms. Concluding, the filtering and modelling approaches that both estimate a model of the measurement error did not outperform the data transformation approaches for this application. This is probably due to the limited difference in measurement error and the fact that estimation of measurement error models is unstable due to the small number of repeats available. A transformation of the data improves the classification of the two groups. [ABSTRACT FROM AUTHOR]

The prediction of protein complexes from protein-protein interactions (PPIs) is a well-studied problem in bioinformatics. However, the currently available PPI data is not enough to describe all known protein complexes. In this paper, we express the problem of determining the minimum number of (additional) required protein-protein interactions as a graph theoretic problem under the constraint that each complex constitutes a connected component in a PPI network. For this problem, we develop two computational methods: one is based on integer linear programming (ILPMinPPI) and the other one is based on an existing greedy-type approximation algorithm (GreedyMinPPI) originally developed in the context of communication and social networks. Since the former method is only applicable to datasets of small size, we apply the latter method to a combination of the CYC2008 protein complex dataset and each of eight PPI datasets (STRING, MINT, BioGRID, IntAct, DIP, BIND, WI-PHI, iRefIndex). The results show that the minimum number of additional required PPIs ranges from 51 (STRING) to 964 (BIND), and that even the four best PPI databases, STRING (51), BioGRID (67), WI-PHI (93) and iRefIndex (85), do not include enough PPIs to form all CYC2008 protein complexes. We also demonstrate that the proposed problem framework and our solutions can enhance the prediction accuracy of existing PPI prediction methods. ILPMinPPI can be freely downloaded from . [ABSTRACT FROM AUTHOR]

It is generally recognized that insect odorant binding proteins (OBPs) mediate the solubilisation and transport of hydrophobic odorant molecules and contribute to the sensitivity of the insect olfactory system. However, the exact mechanism by which OBPs deliver odorants to olfactory receptors and their role, if any, as selectivity filters for specific odorants, are still a matter of debate. In the case of Anopheles gambiae, recent studies indicate that ligand discrimination is effected through the formation of heterodimers such as AgamOBP1 and AgamOBP4 (odorant binding proteins 1 and 4 from Anopheles gambiae). Furthermore, AgamOBPs have been reported to be promiscuous in binding more than one ligand simultaneously and repellents such as DEET (N,N-diethyl-3-toluamide) and 6-MH (6-methyl-5-hepten-2-one) interact directly with mosquito OBPs and/or compete for the binding of attractive odorants thus disrupting OBP heterodimerisation. In this paper, we propose mechanisms of action of DEET and 6-MH. We also predict that ligand binding can occur in several locations of AgamOBP1 with partial occupancies and propose structural features appropriate for repellent pharmacophores. [ABSTRACT FROM AUTHOR]

RNA-protein binding is critical to gene regulation, controlling fundamental processes including splicing, translation, localization and stability, and aberrant RNA-protein interactions are known to play a role in a wide variety of diseases. However, molecular understanding of RNA-protein interactions remains limited; in particular, identification of RNA motifs that bind proteins has long been challenging, especially when such motifs depend on both sequence and structure. Moreover, although RNA binding proteins (RBPs) often contain more than one binding domain, algorithms capable of identifying more than one binding motif simultaneously have not been developed. In this paper we present a novel pipeline to determine binding peaks in crosslinking immunoprecipitation (CLIP) data, to discover multiple possible RNA sequence/structure motifs among them, and to experimentally validate such motifs. At the core is a new semi-automatic algorithm SARNAclust, the first unsupervised method to identify and deconvolve multiple sequence/structure motifs simultaneously. SARNAclust computes similarity between sequence/structure objects using a graph kernel, providing the ability to isolate the impact of specific features through the bulge graph formalism. Application of SARNAclust to synthetic data shows its capability of clustering 5 motifs at once with a V-measure value of over 0.95, while GraphClust achieves only a V-measure of 0.083 and RNAcontext cannot detect any of the motifs. When applied to existing eCLIP sets, SARNAclust finds known motifs for SLBP and HNRNPC and novel motifs for several other RBPs such as AGGF1, AKAP8L and ILF3. We demonstrate an experimental validation protocol, a targeted Bind-n-Seq-like high-throughput sequencing approach that relies on RNA inverse folding for oligo pool design, that can validate the components within the SLBP motif. Finally, we use this protocol to experimentally interrogate the SARNAclust motif predictions for protein ILF3. Our results support a newly identified partially double-stranded UUUUUGAGA motif similar to that known for the splicing factor HNRNPC. [ABSTRACT FROM AUTHOR]

Post-translational modification refers to the biological mechanism involved in the enzymatic modification of proteins after being translated in the ribosome. This mechanism comprises a wide range of structural modifications, which bring dramatic variations to the biological function of proteins. One of the recently discovered modifications is succinylation. Although succinylation can be detected through mass spectrometry, its current experimental detection turns out to be a timely process unable to meet the exponential growth of sequenced proteins. Therefore, the implementation of fast and accurate computational methods has emerged as a feasible solution. This paper proposes a novel classification approach, which effectively incorporates the secondary structure and evolutionary information of proteins through profile bigrams for succinylation prediction. The proposed predictor, abbreviated as SSEvol-Suc, made use of the above features for training an AdaBoost classifier and consequently predicting succinylated lysine residues. When SSEvol-Suc was compared with four benchmark predictors, it outperformed them in metrics such as sensitivity (0.909), accuracy (0.875) and Matthews correlation coefficient (0.75). [ABSTRACT FROM AUTHOR]

DNA-binding proteins play pivotal roles in alternative splicing, RNA editing, methylating and many other biological functions for both eukaryotic and prokaryotic proteomes. Predicting the functions of these proteins from primary amino acids sequences is becoming one of the major challenges in functional annotations of genomes. Traditional prediction methods often devote themselves to extracting physiochemical features from sequences but ignoring motif information and location information between motifs. Meanwhile, the small scale of data volumes and large noises in training data result in lower accuracy and reliability of predictions. In this paper, we propose a deep learning based method to identify DNA-binding proteins from primary sequences alone. It utilizes two stages of convolutional neutral network to detect the function domains of protein sequences, and the long short-term memory neural network to identify their long term dependencies, an binary cross entropy to evaluate the quality of the neural networks. When the proposed method is tested with a realistic DNA binding protein dataset, it achieves a prediction accuracy of 94.2% at the Matthew’s correlation coefficient of 0.961. Compared with the LibSVM on the arabidopsis and yeast datasets via independent tests, the accuracy raises by 9% and 4% respectively. Comparative experiments using different feature extraction methods show that our model performs similar accuracy with the best of others, but its values of sensitivity, specificity and AUC increase by 27.83%, 1.31% and 16.21% respectively. Those results suggest that our method is a promising tool for identifying DNA-binding proteins. [ABSTRACT FROM AUTHOR]

The sampling of scale-free networks in Molecular Biology is usually achieved by growing networks from a seed using recursive algorithms with elementary moves which include the addition and deletion of nodes and bonds. These algorithms include the Barabási-Albert algorithm. Later algorithms, such as the Duplication-Divergence algorithm, the Solé algorithm and the iSite algorithm, were inspired by biological processes underlying the evolution of protein networks, and the networks they produce differ essentially from networks grown by the Barabási-Albert algorithm. In this paper the mean field analysis of these algorithms is reconsidered, and extended to variant and modified implementations of the algorithms. The degree sequences of scale-free networks decay according to a powerlaw distribution, namely P(k) ∼ k− γ, where γ is a scaling exponent. We derive mean field expressions for γ, and test these by numerical simulations. Generally, good agreement is obtained. We also found that some algorithms do not produce scale-free networks (for example some variant Barabási-Albert and Solé networks). [ABSTRACT FROM AUTHOR]

Background: DSC is used to determine thermally-induced conformational changes of biomolecules within a blood plasma sample. Recent research has indicated that DSC curves (or thermograms) may have different characteristics based on disease status and, thus, may be useful as a monitoring and diagnostic tool for some diseases. Since thermograms are curves measured over a range of temperature values, they are considered functional data. In this paper we apply functional data analysis techniques to analyze differential scanning calorimetry (DSC) data from individuals from the Lupus Family Registry and Repository (LFRR). The aim was to assess the effect of lupus disease status as well as additional covariates on the thermogram profiles, and use FD analysis methods to create models for classifying lupus vs. control patients on the basis of the thermogram curves. Methods: Thermograms were collected for 300 lupus patients and 300 controls without lupus who were matched with diseased individuals based on sex, race, and age. First, functional regression with a functional response (DSC) and categorical predictor (disease status) was used to determine how thermogram curve structure varied according to disease status and other covariates including sex, race, and year of birth. Next, functional logistic regression with disease status as the response and functional principal component analysis (FPCA) scores as the predictors was used to model the effect of thermogram structure on disease status prediction. The prediction accuracy for patients with Osteoarthritis and Rheumatoid Arthritis but without Lupus was also calculated to determine the ability of the classifier to differentiate between Lupus and other diseases. Data were divided 1000 times into separate 2/3 training and 1/3 test data for evaluation of predictions. Finally, derivatives of thermogram curves were included in the models to determine whether they aided in prediction of disease status. Results: Functional regression with thermogram as a functional response and disease status as predictor showed a clear separation in thermogram curve structure between cases and controls. The logistic regression model with FPCA scores as the predictors gave the most accurate results with a mean 79.22% correct classification rate with a mean sensitivity = 79.70%, and specificity = 81.48%. The model correctly classified OA and RA patients without Lupus as controls at a rate of 75.92% on average with a mean sensitivity = 79.70% and specificity = 77.6%. Regression models including FPCA scores for derivative curves did not perform as well, nor did regression models including covariates. Conclusion: Changes in thermograms observed in the disease state likely reflect covalent modifications of plasma proteins or changes in large protein-protein interacting networks resulting in the stabilization of plasma proteins towards thermal denaturation. By relating functional principal components from thermograms to disease status, our Functional Principal Component Analysis model provides results that are more easily interpretable compared to prior studies. Further, the model could also potentially be coupled with other biomarkers to improve diagnostic classification for lupus. [ABSTRACT FROM AUTHOR]

Automatic extraction of protein-protein interaction (PPI) pairs from biomedical literature is a widely examined task in biological information extraction. Currently, many kernel based approaches such as linear kernel, tree kernel, graph kernel and combination of multiple kernels has achieved promising results in PPI task. However, most of these kernel methods fail to capture the semantic relation information between two entities. In this paper, we present a special type of tree kernel for PPI extraction which exploits both syntactic (structural) and semantic vectors information known as Distributed Smoothed Tree kernel (DSTK). DSTK comprises of distributed trees with syntactic information along with distributional semantic vectors representing semantic information of the sentences or phrases. To generate robust machine learning model composition of feature based kernel and DSTK were combined using ensemble support vector machine (SVM). Five different corpora (AIMed, BioInfer, HPRD50, IEPA, and LLL) were used for evaluating the performance of our system. Experimental results show that our system achieves better f-score with five different corpora compared to other state-of-the-art systems. [ABSTRACT FROM AUTHOR]

How to identify protein complex is an important and challenging task in proteomics. It would make great contribution to our knowledge of molecular mechanism in cell life activities. However, the inherent organization and dynamic characteristic of cell system have rarely been incorporated into the existing algorithms for detecting protein complexes because of the limitation of protein-protein interaction (PPI) data produced by high throughput techniques. The availability of time course gene expression profile enables us to uncover the dynamics of molecular networks and improve the detection of protein complexes. In order to achieve this goal, this paper proposes a novel algorithm DCA (Dynamic Core-Attachment). It detects protein-complex core comprising of continually expressed and highly connected proteins in dynamic PPI network, and then the protein complex is formed by including the attachments with high adhesion into the core. The integration of core-attachment feature into the dynamic PPI network is responsible for the superiority of our algorithm. DCA has been applied on two different yeast dynamic PPI networks and the experimental results show that it performs significantly better than the state-of-the-art techniques in terms of prediction accuracy, hF-measure and statistical significance in biology. In addition, the identified complexes with strong biological significance provide potential candidate complexes for biologists to validate. [ABSTRACT FROM AUTHOR]

The Min protein system creates a dynamic spatial pattern in Escherichia coli cells where the proteins MinD and MinE oscillate from pole to pole. MinD positions MinC, an inhibitor of FtsZ ring formation, contributing to the mid-cell localization of cell division. In this paper, Fourier analysis is used to decompose experimental and model MinD spatial distributions into time-dependent harmonic components. In both experiment and model, the second harmonic component is responsible for producing a mid-cell minimum in MinD concentration. The features of this harmonic are robust in both experiment and model. Fourier analysis reveals a close correspondence between the time-dependent behaviour of the harmonic components in the experimental data and model. Given this, each molecular species in the model was analysed individually. This analysis revealed that membrane-bound MinD dimer shows the mid-cell minimum with the highest contrast when averaged over time, carrying the strongest signal for positioning the cell division ring. This concurs with previous data showing that the MinD dimer binds to MinC inhibiting FtsZ ring formation. These results show that non-linear interactions of Min proteins are essential for producing the mid-cell positioning signal via the generation of second-order harmonic components in the time-dependent spatial protein distribution. [ABSTRACT FROM AUTHOR]

Since the importance of DNA-binding proteins in multiple biomolecular functions has been recognized, an increasing number of researchers are attempting to identify DNA-binding proteins. In recent years, the machine learning methods have become more and more compelling in the case of protein sequence data soaring, because of their favorable speed and accuracy. In this paper, we extract three features from the protein sequence, namely NMBAC (Normalized Moreau-Broto Autocorrelation), PSSM-DWT (Position-specific scoring matrix—Discrete Wavelet Transform), and PSSM-DCT (Position-specific scoring matrix—Discrete Cosine Transform). We also employ feature selection algorithm on these feature vectors. Then, these features are fed into the training SVM (support vector machine) model as classifier to predict DNA-binding proteins. Our method applys three datasets, namely PDB1075, PDB594 and PDB186, to evaluate the performance of our approach. The PDB1075 and PDB594 datasets are employed for Jackknife test and the PDB186 dataset is used for the independent test. Our method achieves the best accuracy in the Jacknife test, from 79.20% to 86.23% and 80.5% to 86.20% on PDB1075 and PDB594 datasets, respectively. In the independent test, the accuracy of our method comes to 76.3%. The performance of independent test also shows that our method has a certain ability to be effectively used for DNA-binding protein prediction. The data and source code are at . [ABSTRACT FROM AUTHOR]