Methods for fitting equations with two or more non-linear parameters.
Ontology highlight
ABSTRACT:
SUBMITTER: Nimmo IA
PROVIDER: S-EPMC1163877 | biostudies-other | 1976 Aug
REPOSITORIES: biostudies-other
Similar Datasets
Project description:The known jackknife methods (i.e. standard jackknife, weighted jackknife, linear jackknife and weighted linear jackknife) for the determination of the parameters (as well as of their confidence regions) were tested and compared with the simple Marquardt's technique (comprising the calculation of confidence intervals from the variance-co-variance matrix). The simulated data corresponding to the Michaelis-Menten equation with defined structure and magnitude of error of the dependent variable were used for fitting. There were no essential differences between the results of both point and interval parameter estimations by the tested methods. Marquardt's procedure yielded slightly better results than the jackknives for five scattered data points (the use of this method is advisable for routine analyses). The classical jackknife was slightly superior to the other methods for 20 data points (this method can be recommended for very precise calculations if great numbers of data are available). The weighting does not seem to be necessary in this type of equation because the parameter estimates obtained with all methods with the use of constant weights were comparable with those calculated with the weights corresponding exactly to the real error structure whereas the relative weighting led to rather worse results.
| S-EPMC1152718 | biostudies-other
Project description:The integrated rate equation for reactions with stoichiometry A----P + Q is: e0t = -Cf . ln(1-delta P/A0) + C1 delta P + 1/2C2(delta P)2 where the coefficients C are linear or quadratic functions of the kinetic constants and the initial substrate and product concentrations. I have used the 21 progress curves described in the accompanying paper [Cox & Boeker (1987) Biochem. J. 245, 59-65] to develop computer-based analytical and statistical techniques for extracting kinetic constants by fitting this equation. The coefficients C were calculated by an unweighted non-linear regression: first approximations were obtained from a multiple regression of t on delta P and were refined by the Gauss-Newton method. The procedure converged in six iterations or less. The bias in the coefficients C was estimated by four methods and did not appear to be significant. The residuals in the progress curves appear to be normally distributed and do not correlate with the amount of product produced. Variances for Cf, C1 and C2 were estimated by four resampling procedures, which gave essentially identical results, and by matrix inversion, which came close to the others. The reliability of C2 can also be estimated by using an analysis-of-variance method that does not require resampling. The final kinetic constants were calculated by standard multiple regression, weighting each coefficient according to its variance. The weighted residuals from this procedure were normally distributed.
| S-EPMC1148083 | biostudies-other
Project description:OBJECTIVES:The present paper describes a new algorithm to find a root of non-linear transcendental equations. It is found that Regula-Falsi method always gives guaranteed result but slow convergence. However, Newton-Raphson method does not give guaranteed result but faster than Regula-Falsi method. Therefore, the present paper used these two ideas and developed a new algorithm which has better convergence than Regula-Falsi and guaranteed result. One of the major issue in Newton-Raphson method is, it fails when first derivative is zero or approximately zero. RESULTS:The proposed method implemented the failure condition of Newton-Raphson method with better convergence. Error calculation has been discussed for certain real life examples using Bisection, Regula-Falsi, Newton-Raphson method and new proposed method. The computed results show that the new proposed quadratically convergent method provides better convergence than other methods.
| S-EPMC6302413 | biostudies-literature
Project description:Differential analysis of whole cell proteomes by mass spectrometry has largely been applied using various forms of stable isotope labeling. While metabolic stable isotope labeling has been the method of choice, it is often not possible to apply such an approach. Four different label free ways of calculating expression ratios in a classic "two-state" experiment are compared: signal intensity at the peptide level, signal intensity at the protein level, spectral counting at the peptide level, and spectral counting at the protein level. The quantitative data were mined from a dataset of 1245 qualitatively identified proteins, about 56% of the protein encoding open reading frames from Porphyromonas gingivalis, a Gram-negative intracellular pathogen being studied under extracellular and intracellular conditions. Two different control populations were compared against P. gingivalis internalized within a model human target cell line. The q-value statistic, a measure of false discovery rate previously applied to transcription microarrays, was applied to proteomics data. For spectral counting, the most logically consistent estimate of random error came from applying the locally weighted scatter plot smoothing procedure (LOWESS) to the most extreme ratios generated from a control technical replicate, thus setting upper and lower bounds for the region of experimentally observed random error.
| S-EPMC2662607 | biostudies-literature
Project description:Reduced models are equivalent models to the full model that enable reduction in the computational demand for solving the problem, here, mixed model equations for estimating breeding values of selection candidates. Since phenotyped animals provide data to the model, the aim of this study was to reduce animal models to those equations corresponding to phenotyped animals. Non-phenotyped ancestral animals have normally been included in analyses as they facilitate formation of the inverse numerator relationship matrix. However, a reduced model can exclude those animals and obtain identical solutions for the breeding values of the animals of interest. Solutions corresponding to non-phenotyped animals can be back-solved from the solutions of phenotyped animals and specific blocks of the inverted relationship matrix. This idea was extended to other forms of animal model and the results from each reduced model (and back-solving) were identical to the results from the corresponding full model. Previous studies have been mainly focused on reduced animal models that absorb equations corresponding to non-parents and solve equations only for parents of phenotyped animals. These two types of reduced animal model can be combined to formulate only equations corresponding to phenotyped parents of phenotyped progeny.
| S-EPMC8019830 | biostudies-literature
Project description:The theoretical basis for the direct linear plot [Eisenthal & Cornish-Bowden (1974) Biochem. J. 139, 715-720], a non-parametric statistical method for the analysis of data-fitting the Michaelis-Menten equation, was reinvestigated in order to accommodate additional experimental designs and to provide estimates of precision more directly comparable with those obtained by parametric statistical methods. Methods are given for calculating upper and lower confidence limits for the estimated parameters, for accommodating replicate measurements and for comparing the results of two separate experiments. Factors that influence the proper design of experiments are discussed.
| S-EPMC1164507 | biostudies-other
Project description:Consider an underdetermined system of linear equations y = Ax with known y and d x n matrix A. We seek the nonnegative x with the fewest nonzeros satisfying y = Ax. In general, this problem is NP-hard. However, for many matrices A there is a threshold phenomenon: if the sparsest solution is sufficiently sparse, it can be found by linear programming. We explain this by the theory of convex polytopes. Let a(j) denote the jth column of A, 1 < or = j < or = n, let a0 = 0 and P denote the convex hull of the a(j). We say the polytope P is outwardly k-neighborly if every subset of k vertices not including 0 spans a face of P. We show that outward k-neighborliness is equivalent to the statement that, whenever y = Ax has a nonnegative solution with at most k nonzeros, it is the nonnegative solution to y = Ax having minimal sum. We also consider weak neighborliness, where the overwhelming majority of k-sets of a(j)s not containing 0 span a face of P. This implies that most nonnegative vectors x with k nonzeros are uniquely recoverable from y = Ax by linear programming. Numerous corollaries follow by invoking neighborliness results. For example, for most large n by 2n underdetermined systems having a solution with fewer nonzeros than roughly half the number of equations, the sparsest solution can be found by linear programming.
| S-EPMC1172251 | biostudies-literature
Project description:BackgroundThe miRNAs are small non-coding RNAs of roughly 22 nucleotides in length, which can bind with and inhibit protein coding mRNAs through complementary base pairing. By degrading mRNAs and repressing proteins, miRNAs regulate the cell signaling and cell functions. This paper focuses on innovative mathematical techniques to model gene interactions by algorithmic analysis of microarray data. Our goal was to elucidate which mRNAs were actually degraded or had their translation inhibited by miRNAs belonging to a very large pool of potential miRNAs.ResultsWe proposed two chemical kinetics equations (CKEs) to model the interactions between miRNAs, mRNAs and the associated proteins. In order to reduce computational cost, we used a non linear profile clustering method named minimal net clustering and efficiently condensed the large set of expression profiles observed in our microarray data sets. We determined unknown parameters of the CKE models by minimizing the discrepancy between model prediction and data, using our own fast non linear optimization algorithm. We then retained only the CKE models for which the optimized fit to microarray data is of high quality and validated multiple miRNA-mRNA pairs.ConclusionThe implementation of CKE modeling and minimal net clustering reduces drastically the potential set of miRNA-mRNA pairs, with a high gain for further experimental validations. The minimal net clustering also provides good miRNA candidates that have similar regulatory roles.
| S-EPMC3937077 | biostudies-literature
Project description:Two methods are described for fitting the Michaelis-Menten equation to sets of data with a common michaelis constant but different maximum velocities. One of them uses the method of least squares, and the other is based on the direct plot of Eisenthal & Cornish-Bowden [Biochem. J. (1974) 139, 715-720].
| S-EPMC1163878 | biostudies-other
Project description:The methods of Atkins & Nimmo (1973) and Fernley (1974) for fitting the integrated Michaelis-Menten equation were compared by using the same sets of simulated experimental data. The method of Fernley (1974) is to be preferred because it gives precise and unbiased estimates of the Michaelis-Menten parameters over a wide range of substrate concentrations. However, the estimates may not be symmetrically distributed, especially at low substrate concentrations.
| S-EPMC1168197 | biostudies-other