Discrimination in a General Algebraic Setting.
Ontology highlight
ABSTRACT:
SUBMITTER: Fine B
PROVIDER: S-EPMC4485932 | biostudies-other | 2015
REPOSITORIES: biostudies-other
Similar Datasets
Project description:Biomolecular circuits with two distinct and stable steady states have been identified as essential components in a wide range of biological networks, with a variety of mechanisms and topologies giving rise to their important bistable property. Understanding the differences between circuit implementations is an important question, particularly for the synthetic biologist faced with determining which bistable circuit design out of many is best for their specific application. In this work we explore the applicability of Sturm's theorem--a tool from nineteenth-century real algebraic geometry--to comparing 'functionally equivalent' bistable circuits without the need for numerical simulation. We first consider two genetic toggle variants and two different positive feedback circuits, and show how specific topological properties present in each type of circuit can serve to increase the size of the regions of parameter space in which they function as switches. We then demonstrate that a single competitive monomeric activator added to a purely monomeric (and otherwise monostable) mutual repressor circuit is sufficient for bistability. Finally, we compare our approach with the Routh-Hurwitz method and derive consistent, yet more powerful, parametric conditions. The predictive power and ease of use of Sturm's theorem demonstrated in this work suggest that algebraic geometric techniques may be underused in biomolecular circuit analysis.
| S-EPMC4528596 | biostudies-literature
Project description:A common problem when analyzing models, such as mathematical modeling of a biological process, is to determine if the unknown parameters of the model can be determined from given input-output data. Identifiable models are models such that the unknown parameters can be determined to have a finite number of values given input-output data. The total number of such values over the complex numbers is called the identifiability degree of the model. Unidentifiable models are models such that the unknown parameters can have an infinite number of values given input-output data. For unidentifiable models, a set of identifiable functions of the parameters are sought so that the model can be reparametrized in terms of these functions yielding an identifiable model. In this work, we use numerical algebraic geometry to determine if a model given by polynomial or rational ordinary differential equations is identifiable or unidentifiable. For identifiable models, we present a novel approach to compute the identifiability degree. For unidentifiable models, we present a novel numerical differential algebra technique aimed at computing a set of algebraically independent identifiable functions. Several examples are used to demonstrate the new techniques.
| S-EPMC6910699 | biostudies-literature
Project description:The AUC (area under ROC curve) is a commonly used metric to assess discrimination of risk prediction rules; however, standard errors of AUC are usually based on the Mann-Whitney U test that assumes independence of sampling units. For ophthalmologic applications, it is desirable to assess risk prediction rules based on eye-specific outcome variables which are generally highly, but not perfectly correlated in fellow eyes [e.g. progression of individual eyes to age-related macular degeneration (AMD)]. In this article, we use the extended Mann-Whitney U test (Rosner and Glynn, Biometrics 65:188-197, 2009) for the case where subunits within a cluster may have different progression status and assess discrimination of different prediction rules in this setting. Both data analyses based on progression of AMD and simulation studies show reasonable accuracy of this extended Mann-Whitney U test to assess discrimination of eye-specific risk prediction rules.
| S-EPMC3622772 | biostudies-literature
Project description:According to conventional wisdom, electric double-layer forces normally decay exponentially with separation distance. Here, we present experimental evidence of algebraically decaying double-layer interactions. We show that algebraic interactions arise in both strongly overlapping as well as counterion-only regimes, albeit the evidence is less clear for the former regime. In both of these cases, the disjoining pressure profile assumes an inverse square distance dependence. At small separation distances, another algebraic regime is recovered. In this regime, the pressure decays as the inverse of separation distance.
| S-EPMC6968886 | biostudies-literature
Project description:Understanding protein structure and dynamics is essential for understanding their function. This is a challenging task due to the high complexity of the conformational landscapes of proteins and their rugged energy levels. In particular, it is important to detect highly populated regions which could correspond to intermediate structures or local minima.We present a hierarchical clustering and algebraic topology based method that detects regions of interest in protein conformational space. The method is based on several techniques. We use coarse grained protein conformational search, efficient robust dimensionality reduction and topological analysis via persistent homology as the main tools. We use two dimensionality reduction methods as well, robust Principal Component Analysis (PCA) and Isomap, to generate a reduced representation of the data while preserving most of the variance in the data.Our hierarchical clustering method was able to produce compact, well separated clusters for all the tested examples.
| S-EPMC5731496 | biostudies-literature
Project description:The outcome of a functional genomics pipeline is usually a partial list of genomic features, ranked by their relevance in modelling biological phenotype in terms of a classification or regression model. Due to resampling protocols or to a meta-analysis comparison, it is often the case that sets of alternative feature lists (possibly of different lengths) are obtained, instead of just one list. Here we introduce a method, based on permutations, for studying the variability between lists ("list stability") in the case of lists of unequal length. We provide algorithms evaluating stability for lists embedded in the full feature set or just limited to the features occurring in the partial lists. The method is demonstrated by finding and comparing gene profiles on a large prostate cancer dataset, consisting of two cohorts of patients from different countries, for a total of 455 samples.
| S-EPMC3355159 | biostudies-literature
Project description:BackgroundComputed tomography (CT) is an advanced medical imaging technology. The images obtained by CT are helpful for improving diagnostic accuracy. Currently, CT is widely used in clinical settings for diagnosis and health examinations. However, full angle CT scanning has the disadvantage of causing radiation damage to the human body. Sparse angle projection CT scanning is the most effective way to minimize this damage, but the quality of the reconstructed image is reduced. Therefore, it is important to improve the reconstructed image quality produced by sparse angle projection.MethodsIn this paper, we focused on the algebraic reconstruction algorithm. To reduce the accumulation of random noise, we formulated a modified algebraic reconstruction algorithm. Firstly, the algebraic reconstruction algorithm was used to compute two consecutive results, and then the weighted sum of these two results was used to correct the reconstructed image, and an iterative result was obtained. Using this method, we aimed to reduce the noise accumulation caused by iteration.ResultsIn this study, 20 angle projections were used for the reconstruction. The experimental object was the Shepp-Logan phantom test image. The experiments were implemented under two conditions: without noise and with noise. The peak signal to noise ratio (PSNR) and the mean squared error (MSE) of the reconstructed image from projections without noise were 76.0896 and 0.0016, respectively. The PSNR and MSE of the reconstructed image from projections with noise were 75.8263 and 0.0017, respectively. The reconstructed performance was superior to the previous algebraic reconstruction algorithm.ConclusionsThe performance of the proposed method was superior to other algorithms, which confirms that noise accumulation caused by iteration can be effectively reduced by the weighted summation of two consecutive reconstruction results. Moreover, the reconstruction performance under noisy projection is superior to other algorithms, which demonstrates that the proposed method improves anti-noise performance.
| S-EPMC8506772 | biostudies-literature
Project description:A convex code is a binary code generated by the pattern of intersections of a collection of open convex sets in some Euclidean space. Convex codes are relevant to neuroscience as they arise from the activity of neurons that have convex receptive fields. In this paper, we use algebraic methods to determine if a code is convex. Specifically, we use the neural ideal of a code, which is a generalization of the Stanley-Reisner ideal. Using the neural ideal together with its standard generating set, the canonical form, we provide algebraic signatures of certain families of codes that are non-convex. We connect these signatures to the precise conditions on the arrangement of sets that prevent the codes from being convex. Finally, we also provide algebraic signatures for some families of codes that are convex, including the class of intersection-complete codes. These results allow us to detect convexity and non-convexity in a variety of situations, and point to some interesting open questions.
| S-EPMC6750060 | biostudies-literature
Project description:BackgroundGeneral Practitioners (GPs) and Practice Nurses (PNs) collaboratively play an important role in preventing and monitoring chronic diseases. They are trained in Motivational Interviewing (MI), which is a communication style to intrinsically motivate patients to a healthier lifestyle. However, being trained in MI skills does not necessarily mean that it is implemented in daily practice so patients actually benefit. The aim of this study is to identify factors that facilitate or impede the implementation of MI in General Practice.MethodsA total of 152 participants (93 GP-trainees and 59 PN-trainees) who were trained in MI completed a questionnaire regarding the implementation of MI. Semi-structured interviews (N = 17) were conducted with GPs and PNs (ranging from almost graduated to highly experienced) who were selected through the process of maximum variation sampling. The interview guide was based on the five-stage implementation model of Grol and Wensing.ResultsThirteen factors that influence the implementation of MI in General Practice were identified. They can be allocated to three categories: (1) setting factors such as time, (2) GP/PN factors such as self-efficacy, and (3) patient factors such as cultural background.ConclusionsOverall, GPs and PNs considered MI to be useful and part of their professional responsibility. Most difficulties become apparent in stage 4 (change: applying MI skills in practice) and 5 (consolidation: integrating MI into daily routine and embedment in organisation) of Grol and Wensing's model. Therefore, it is important that training does not only focus on MI skills. It is essential to pay explicit attention to the factors that impact implementation, as well as the appropriate tools to tackle the barriers. These insights can help trainers to effectively support GPs and PNs to apply and maintain their MI skills in daily practice.
| S-EPMC8800318 | biostudies-literature
Project description:We formalize algebraic numbers in Isabelle/HOL. Our development serves as a verified implementation of algebraic operations on real and complex numbers. We moreover provide algorithms that can identify all the real or complex roots of rational polynomials, and two implementations to display algebraic numbers, an approximative version and an injective precise one. We obtain verified Haskell code for these operations via Isabelle’s code generator. The development combines various existing formalizations such as matrices, Sturm’s theorem, and polynomial factorization, and it includes new formalizations about bivariate polynomials, unique factorization domains, resultants and subresultants.
| S-EPMC7089722 | biostudies-literature