Set Of Scoring Functions Research Articles

Protein Secondary Structure Prediction with SPARROW

A first step toward predicting the structure of a protein is to determine its secondary structure. The secondary structure information is generally used as starting point to solve protein crystal structures. In the present study, a machine learning approach based on a complete set of two-class scoring functions was used. Such functions discriminate between two specific structural classes or between a single specific class and the rest. The approach uses a hierarchical scheme of scoring functions and a neural network. The parameters are determined by optimizing the recall of learning data. Quality control is performed by predicting separate independent test data. A first set of scoring functions is trained to correlate the secondary structures of residues with profiles of sequence windows of width 15, centered at these residues. The sequence profiles are obtained by multiple sequence alignment with PSI-BLAST. A second set of scoring functions is trained to correlate the secondary structures of the center residues with the secondary structures of all other residues in the sequence windows used in the first step. Finally, a neural network is trained using the results from the second set of scoring functions as input to make a decision on the secondary structure class of the residue in the center of the sequence window. Here, we consider the three-class problem of helix, strand, and other secondary structures. The corresponding prediction scheme "SPARROW" was trained with the ASTRAL40 database, which contains protein domain structures with less than 40% sequence identity. The secondary structures were determined with DSSP. In a loose assignment, the helix class contains all DSSP helix types (α, 3-10, π), the strand class contains β-strand and β-bridge, and the third class contains the other structures. In a tight assignment, the helix and strand classes contain only α-helix and β-strand classes, respectively. A 10-fold cross validation showed less than 0.8% deviation in the fraction of correct structure assignments between true prediction and recall of data used for training. Using sequences of 140,000 residues as a test data set, 80.46% ± 0.35% of secondary structures are predicted correctly in the loose assignment, a prediction performance, which is very close to the best results in the field. Most applications are done with the loose assignment. However, the tight assignment yields 2.25% better prediction performance. With each individual prediction, we also provide a confidence measure providing the probability that the prediction is correct. The SPARROW software can be used and downloaded on the Web page http://agknapp.chemie.fu-berlin.de/sparrow/ .

Scoring-and-unfolding trimmed tree assembler: concepts, constructs and comparisons

Mired by its connection to a well-known -complete combinatorial optimization problem-namely, the Shortest Common Superstring Problem (SCSP)-historically, the whole-genome sequence assembly (WGSA) problem has been assumed to be amenable only to greedy and heuristic methods. By placing efficiency as their first priority, these methods opted to rely only on local searches, and are thus inherently approximate, ambiguous or error prone, especially, for genomes with complex structures. Furthermore, since choice of the best heuristics depended critically on the properties of (e.g. errors in) the input data and the available long range information, these approaches hindered designing an error free WGSA pipeline. We dispense with the idea of limiting the solutions to just the approximated ones, and instead favor an approach that could potentially lead to an exhaustive (exponential-time) search of all possible layouts. Its computational complexity thus must be tamed through a constrained search (Branch-and-Bound) and quick identification and pruning of implausible overlays. For his purpose, such a method necessarily relies on a set of score functions (oracles) that can combine different structural properties (e.g. transitivity, coverage, physical maps, etc.). We give a detailed description of this novel assembly framework, referred to as Scoring-and-Unfolding Trimmed Tree Assembler (SUTTA), and present experimental results on several bacterial genomes using next-generation sequencing technology data. We also report experimental evidence that the assembly quality strongly depends on the choice of the minimum overlap parameter k. SUTTA's binaries are freely available to non-profit institutions for research and educational purposes at http://www.bioinformatics.nyu.edu.

Iteratively Reweighted Generalized Least Squares for Estimation and Testing With Correlated Data: An Inference Function Framework

The focus of this article is on fitting regression models and testing of general linear hypotheses for correlated data using quasi-likelihood based techniques. The class of generalized method of moments or GMMs provides an elegant approach for estimating a vector of regression parameters from a set of score functions. Extending the principle of the GMMs, in the generalized estimating equation framework, leads to a quadratic inference function or QIF approach for the analysis of correlated data. We derive an iteratively reweighted generalized least squares or IRGLS algorithm for finding the QIF estimator and establish its convergence properties. A software library implementing the techniques is demonstrated through several datasets.

Multinomial probit estimation without nuisance parameters

Summary A feasible multinomial estimation procedure is derived, which does not require parameterization of the elements in the covariance matrix. The estimation is carried out using a simulated expectation-maximization algorithm, where the covariance structure is evaluated based on a set of score functions, while the structural coefficients are derived using standard multinomial probit (MNP) conditional on the given covariance structure. This methodology is demonstrated using a Monte Carlo simulation on both rank-ordered and non-ranked data, and on a real data set involving the choice of local residential telephone service. For limited finite samples, the procedure is shown to be superior to conventional MNP since it is faster, involves fewer parameters, and generates estimates with smaller variances.