<title>Background</title> <p>It is estimated that around 90% of human genetic variations are differences in single bases of DNA, known as single nucleotide polymorphisms (SNPs) [##REF##9872978##1##]. Among them, non-synonymous single nucleotide polymorphisms (nsSNPs), also known as single amino acid polymorphism (SAPs), that cause amino acid changes in proteins have the potential to affect both protein structure and protein function [##REF##12754702##2##]. Some of the mutations in SAP sites are not associated with any changes in phenotype and are considered functional neutral, but others bringing deleterious effects to protein function and are responsible for many human genetic diseases [##REF##11875032##3##,##REF##15164070##4##]. Recent years have seen an explosion in the number of SAPs in public databases, such as dbSNP [##REF##11125122##5##], HGVBASE [##REF##14681471##6##] and SWISSPROT [##REF##15108278##7##]. The large size of these databases presents a challenging hurdle for annotating the effects of all SAPs by experimental approaches. Therefore, computational methods that can quickly distinguish diseasing-causing SAPs from neutral SAPs are in urgent need.</p> <p>Many methods have been proposed to classify SAPs. Earlier methods are based on empirical rules [##UREF##0##8##,##REF##11337480##9##] or probabilistic models [##REF##11254390##10##]. Recent methods are based on machine learning techniques, such as decision trees [##REF##16630345##11##,##REF##14630648##12##], random forests [##REF##15746281##13##], neural networks [##UREF##1##14##,##REF##17526529##15##], support vector machines [##REF##14630648##12##,##REF##15746281##13##,##REF##16895930##16##, ####REF##16169011##17##, ##REF##17384424##18####17384424##18##]s. Some of these methods [##REF##11337480##9##,##REF##17526529##15##,##REF##16895930##16##] explore only information derived from protein sequence. Others use both structural and sequence features of the SAP sites. A limitation of using structural features as input is that the methods are not applicable when protein structures are unknown. Additionally, all previous methods only consider a small set of features arbitrarily chosen. Systematic analysis is still needed to identify features that play vital roles in determining the effects of SAPs.</p> <p>In this study, we explored the feasibility of classifying SAPs using only information derived from protein sequence. We compiled a set of 686 features based on previous studies and AAindex [##REF##9847231##19##], a public database of amino acid properties. These features are independent of the structure of SAP sites. Thus, the developed method can be used to distinguish disease-causing SAPs from neutral SAPs even when the structures of SAP sites are not known. Then, we used a greedy method to discover useful features from the feature set. Using the 10 selected features, a decision tree method can classify SAPs with 82.6% accuracy and 0.607 Matthews Correlation Coefficient (MCC).</p>
<title>Methods</title> <title>Datasets</title> <p>A dataset of SAPs was obtained from a recent study by Ye et al. [##REF##17384424##18##]. It was collected from the variant pages of the Swiss-Prot knowledgebase. It has 3438 SAPs found in 522 proteins, including 2249 "Disease" and 1189 "Polymorphism" SAPs. We also evaluated the proposed method on the Humvar dataset from the PhD_SNP sever [##REF##16895930##16##], which consists of all SAPs from the Swiss-Prot database. It has 12944 "Disease" and 8241 "polymorphisms" SAPs. The dataset is available online [##UREF##2##24##].</p> <title>Sequence attributes</title> <title>A. Amino acid features obtained from AAindex</title> <p>AAindex [##REF##9847231##19##] is a database of numerical indices representing various physicochemical and biochemical properties of amino acids. Two types of entries are available in AAindex. The first type of entries has 20 values, with each value indicating the property of one amino acid. The second type of entries consists of a 20 × 20 matrix, giving the property between each pair of amino acids, e.g. substitution matrix. We downloaded the current version of AAindex (as of Sept 13, 2007), removed entries with missing values. 666 entries were left, with 531 from the first type and 135 from the second. For each entry <italic>i</italic>, we defined a feature for the SAP site that measured the distance between the wild-type residue and the mutant residue:</p> <p>1) If entry <italic>i </italic>was an entry of the first type, then the feature was given by</p> <p></p> <p>where, index<sub>i</sub>(mut) and index<sub>i</sub>(wildtype) were the property values of wild-type and mutant residues given by entry <italic>i</italic>. Because some of the values in entry <italic>i </italic>could be 0, to avoid zero values in the denominator, the 20 values in entry i were normalized to the range of [0.1, 1.1].</p> <p>2) If entry <italic>i </italic>was an entry of the second type, the feature was given by the value in the matrix corresponding to the pair of mutant and wild-type resides.</p> <title>B. Sequence features used in previous studies</title> <p>In their study, Ye et al. [##REF##17384424##18##] calculated 60 structural and sequence attributes for each SAP site. Here, we took the features from their study and discarded those that were derived from the structure of the SAP sites. 19 features were left. One of them was residue frequency difference (diff_freq) between wild type and mutant type:</p> <p><italic>diff </italic>_<italic>freq </italic>= <italic>mt </italic>_<italic>frq </italic>- <italic>wt </italic>_ <italic>freq</italic></p> <p>where <italic>mt_freq </italic>and <italic>wt_freq </italic>are the frequencies of the mutant-type residue and the wild-type residue in the multiple alignment of homologous sequences. In this study, we introduced another feature (nor_diff_freq) by normalizing the frequency difference:</p> <p></p> <p>Finally, we obtained a set of 666+19+1 = 686 features for each SAP site. Note that in the calculation of these features for an SAP site, the structure of the SAP site was not required.</p> <title>Decision tree algorithm</title> <p>Decision tree has been widely applied in many classification problems, including the classification of SAPs [##REF##16630345##11##,##REF##14630648##12##]. One benefit of using decision tree is that it generates classification rules that can be easily interpreted. In this study, we used the J48 decision tree algorithm implemented in WEKA [##UREF##3##25##].</p> <title>Performance measures</title> <p>Let "Disease" be the positive class and "Polymorphism" be the negative class. Measures used in this study are defined below.</p> <p></p> <p></p> <p>Where <italic>TP </italic>is the number of true positives (i.e., the number of "Disease" SAPs predicted as "Disease"); <italic>TN </italic>is the number of true negatives (i.e., the number of "Polymorphism" SAPs predicted as "Polymorphism"); <italic>FN </italic>is the number of false negatives (i.e., the number of "Disease" incorrectly predicted as "Polymorphism") and <italic>FP </italic>is the number of false positives (i.e., the number of "Polymorphism" incorrectly predicted as "Disease").</p> <p>Accuracy is the overall percentage of SAPs correctly predicted. MCC (Matthews correlation coefficient) measures the correlation between predictions and actual class labels. In a two-class classification, if the numbers of the two classes are not equal, MCC is a better measure for evaluating the performance than accuracy [##REF##10871264##20##]. In this study, the numbers of two classes ("Disease" and "Polymorphism") are not equal. Thus, MCC is used as the primary measure for evaluating the performance in this study.</p> <title>Feature selection, cross-validations, and independent test</title> <p>We developed an automated approach to select useful features from the set of 686 features and applied a decision tree method to classify SAPs into "Disease" and "Polymorphism" classes. The proposed method was evaluated using both cross-validation and independent test. In the study of Ye et al. [##REF##17384424##18##], the dataset was divided into five subsets at the protein level, such that SAPs from the same protein would be put into the same subset. This stringent criterion ensured more rigorous cross-validations than other studies. Thus, we used the same dataset partition as in Ye et al [##REF##17384424##18##].</p> <p>Four subsets were used to perform feature selection based on a (four-fold) cross-validation. In the four-fold cross-validation, there were four rounds of experiments. During each round of experiments, three subsets were used to train the classifier, and the remaining subset was used to test it. In each four-fold cross-validation, the same feature set was used in the four rounds of experiments. The average results of the four rounds were considered. The four-fold cross-validation was repeated using different feature sets (that were selected by the greedy approach mentioned below) until the optimal performance was reached.</p> <p>The fifth subset (independent set) served as the test set in the independent test, in which the classifier was trained using the four subsets and then tested on the independent set. Note that the independent set was not seen by the algorithm during the feature-selection stage and the training of the classifier.</p> <title>Greedy approach for feature selection</title> <p>Four subsets of SAPs were used to select features for building classifiers. Let <italic>S </italic>be the set of the selected features, <italic>A </italic>be the set of available features, and <italic>N </italic>be the size of <italic>A</italic>. At the beginning, <italic>S </italic>is empty and <italic>N </italic>= 686. Features were added into <italic>S </italic>using the following procedure:</p> <p>(1) Pick one feature from <italic>A</italic>;</p> <p>(2) Build classifiers using the newly picked feature and the features in <italic>S</italic>, and then evaluate the classifiers using a four-fold cross-validation;</p> <p>(3) Repeat steps (1) and (2) <italic>N </italic>times, so that every feature in <italic>A </italic>is tried once. The feature that brings the biggest improvement in performance is removed from <italic>A </italic>and added into <italic>S</italic>.</p> <p>This procedure continued until including more features into S does not increase the performance. In the end, 10 features were added into <italic>S</italic>.</p>
<title>Results</title> <title>Classification performance in cross-validation and independent test</title> <p>Four subsets were used to select features using a greedy approach as described in Materials and Methods, and 10 features were obtained. These features were used to build predictors for classifying SAPs.</p> <p>We first evaluated the proposed method using cross-validation. A four-fold cross-validation was performed on the four subsets that were used in feature selection. The results (Table ##TAB##0##1##) show that the method achieves 82.6% accuracy with 0.607 MCC.</p> <p>We then evaluated the proposed method using an independent test, in which the classifier was trained using the four subsets and then tested on an independent set. Note that the independent set was not seen by the algorithm during the feature-selection stage and the training of the classifier. The results (Table ##TAB##0##1##) show that the method achieves 82.6% accuracy with 0.604 MCC in the independent test. Table ##TAB##0##1## also shows that the proposed method achieves consistent results in cross-validation and independent test.</p> <p>To evaluate the usefulness of the feature-selection step, we used all the 686 features to build a predictor and then evaluated it using cross-validation. The predictor built using 686 features only achieved 0.503 MCC with 77.7% accuracy. Thus, the feature-selection step increased MCC by 0.104 and accuracy by 4.9%.</p> <title>Contributions of the selected features</title> <p>In each step of the feature selection, the feature that brought the largest improvement in performance was chosen. Table ##TAB##1##2## shows the 10 selected features in the order that they were chosen. Among the 10 features, the three features shown in italic fonts (<italic>is_HLA, metal_seq_neibor, modres_seq_neibor</italic>) were obtained from the study of Ye et al [##REF##17384424##18##], <italic>nor_diff_freq </italic>is the normalized frequency difference between mutant-type residue and wild-type residue as defined in Materials and Methods, the other features are defined based on entries from AAindex. Figure ##FIG##0##1## shows how the classification performance was increased when features were chosen. Among the 10 selected features, 4 (<italic>nor_diff_freq, DAYM780301, HENS920103 and NAKH900106</italic>) are related to residue frequency and substitution, 3 (<italic>FEND850101, ZHAC000105 and MIYS850103</italic>) are related to structure and contact energy, 2 (<italic>metal_seq_neibor </italic>and <italic>modres_seq_neibor</italic>) indicates whether the SAP site is close to functional sites, and 1 (<italic>is_HLA</italic>) shows the family of the protein. The fact that <italic>is_HLA </italic>is selected as a useful feature probably suggests that different rules apply to different families of proteins.</p> <p>Below is a part of the decision tree built by the decision tree algorithm.</p> <p>   If (nor_diff_freq≤ -0.96) then</p> <p>      Disease</p> <p>   Else if (DAYM780301≤ 3.4) then</p> <p>      If (nor_diff_freq≤ -0.37) then</p> <p>         Disease</p> <p>      Else ...</p> <p>   Else if (DAYM780301&gt;3.4) and (DAYM780301≤ 3.84) then</p> <p>      If (nor_diff_freq≤ -0.90) then</p> <p>         Disease</p> <p>      Else ...</p> <p>   Else if (DAYM780301&gt;3.84) then</p> <p>      If (Metal_seq_neighbor≤ 29) then</p> <p>         Disease</p> <p>      Else then</p> <p>         Polymorphism</p> <p>Following are some of the rules derived from the decision tree:</p> <p>      Rule 1: "If (nor_diff_freq≤ -0.96), then Disease"</p> <p>      Rule 2: "If (DAYM780301≤ 3.4) and (nor_diff_freq≤ -0.37), then Disease"</p> <p>      Rule 3: "If (3.4&lt;DAYM780301≤ 3.84) and (nor_diff_freq≤ -0.90), then</p> <p>   Disease"</p> <p>      Rule 4: "If (DAYM780301&gt;3.84) then</p> <p>         If (Metal_seq_neighbor≤ 29) then</p> <p>            Disease</p> <p>         Else then</p> <p>            Polymorphism"</p> <p>Here, nor_diff_freq (), is a measure of the frequency difference between the mutant type and wild type. A negative value means that the wild type has higher frequency on the SAP position than the mutant type does. The lower is the negative value, the higher is the frequency difference between the wild type and the mutant type. Rule 1 says "If (nor_diff_freq≤ -0.96) then Disease". This rule indicates that if the mutation is from a wild type that has high frequency on the mutation site to a mutant type that has low frequency and if the frequency difference is very high, then the mutation will cause diseases. This reflects the hypothesis that if the SAP causes dramatic changes in sequence and structural stabilities, then the SAP is likely to be deleterious. DAYM780301 is the log odds matrix of PAM 250. The value between two amino acids shows how often one amino acid replaces the other in evolution. The higher is the value, the more frequently one amino acid replaces the other. To facilitate the explanation, let's borrow the term of similarity. The matrix is viewed as a measure of evolutionary similarity between amino acids. Higher values correspond to higher evolutionary similarities between residues. The four rules can be interpreted as below:</p> <p>• Rule 1 says " regardless of the similarity between the mutant type and wild type, if the mutant type has lower frequency than the wild type does at the mutation site, and if the difference between their frequencies is very high (≤ -0.96), then the mutation is disease-related."</p> <p>• Rule 2 says "if the similarity between the mutant type and wild type is very low (≤ 3.4), then although the difference between their frequencies is not very high (only ≤ -0.37), the mutation is still disease-related."</p> <p>• Compared with rule 2, Rule 3 says "if the similarity between the mutant type and wild type is at median levels (3.4&lt;DAYM780301≤ 3.84), then the mutation is disease-related only if the frequency difference between the mutant and wild types is high (has to be ≤ -0.90)."</p> <p>• Compared with rules 1, 2 and 3, Rule 4 shows that if the similarity between the mutant type and wild type is very high (DAYM780301&gt;3.84), then the difference between their frequencies is no longer a crucial factor in determining the effect of the mutation"</p> <p>Together, these rules reflect the biological knowledge that if a mutation causes little changes (in chemical and physical properties, structural stabilities or other properties) to the protein, then mutation is likely neutral. Otherwise, it is likely diseased-related. The frequency difference between the mutant type and the wild type has been shown to be a useful feature for classifying the effect of mutations in many studies. Here these rules suggest that, in addition to the frequency difference, one also need to take into account the similarities (evolutionary, geometrical, or other properties related) between the mutant type and wild type.</p> <title>Comparisons with previously published methods</title> <p>As discussed by Baldi et al. [##REF##10871264##20##], in a two-class classification problem, if the numbers of the two classes are not equal, MCC is a better measure than accuracy for evaluating the classification performance. Thus, we use MCC as the main measure in the comparison of different methods.</p> <p>Ye et al [##REF##17384424##18##] developed a support vector machine (SVM)-based method, SAPRED, that classifies SAPs using 60 structural and sequence-derived features. In the current study, we used the same dataset Ye et al used in their study. On the same dataset, SAPRED achieved 82.6% accuracy and 0.604 MCC, and our method achieve 82.6% accuracy and 0.607 MCC. While the performances of the two methods are comparable, the virtues of our method are two-fold: (1) our method requires only sequence-derived information as input, and thus are applicable to SAPs whose structures are not available; (2) our method is based on a decision tree algorithm that is simpler than the SVM used by SAPRED. During the training of a decision tree-based classifier, there are no parameters needed to be tuned. In contrast, the training of a SVM requires enormous efforts to search for optimal parameters (e.g. C and gamma) and takes a longer time. Compared with SVM, the additional benefit of the decision tree is that the decision tree produces rules that can be easily interpreted. In this study, we also tried SVM instead of decision tree, but no improvement was observed by switching to SVM. Note that, in their study, Ye et al. also presented a sequence-version of SAPRED that only required sequence-derived features as input. But the sequence-version of SAPRED achieved only 0.577 MCC, which is lower than that of our method.</p> <p>Ye et al [##REF##17384424##18##] also compared SAPRED with SIFT [##REF##12824425##21##] using the same dataset used in the current study. Based on the results they reported, the method proposed in the current study achieves an increase of 0.127 in MCC over SIFT. We also submitted the dataset to Panther [##REF##17130144##22##]. Panther only achieves 0.318 MCC. Comparisons of the ROC curves of SIFT, Panther and the current method confirm the improvement the current method over SIFT and Panther (Figure ##FIG##1##2##). As mentioned above, one merit of our method is that it can be applied to cases where the 3D structures of the proteins are not available. We also evaluated our method using all SAPs from the Swiss-Prot variant database. The proposed method achieves 0.42 MCC with 73.2% overall accuracy. In comparison, SIFT achieves only 0.33 MCC. Our method still outperforms SIFT. The ROC curve is showed in Figure ##FIG##2##3##.</p> <p>Bromberg and Rost [##REF##17526529##15##] developed a neural network method (SNAP) for classifying SAPs. They evaluated the method on a dataset obtained from Protein Mutant Database [##REF##9847227##23##] and 78% accuracy was reported. The dataset from Protein Mutant Database is based on experimental amino acid substitutions, while the dataset used in this study is based on observed human alleles. Due to the difference in the datasets used in the two studies, we were unable to make a direct comparison between SNAP and the method proposed in the current study.</p>
<title>Discussion</title> <p>In contrast to previous studies that only considered a small set of arbitrarily chosen features, we used an automated method to discover features for distinguishing deleterious SAPs. The search space is more than ten times larger than those considered in previous studies. Based on the selected features, we developed a decision-tree based method for classifying SAPs. The proposed method only requires sequence-derived features as input. Thus, it can be applied to all SAPs. The performance of the proposed method is comparable to that of SAPRED, a state-of-the-art method that uses both structural and sequence-derived features as input, and is much higher than that of SIFT, a classic method for classifying SAPs.</p>
<title>Conclusion</title> <p>In conclusion, the proposed method is a useful tool for the classification of SAPs, especially, when the structure of the protein is not available.</p>
<p>This is an Open Access article distributed under the terms of the Creative Commons Attribution License (<ext-link ext-link-type="uri" xlink:href="http://creativecommons.org/licenses/by/2.0"/>), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</p> <title>Background</title> <p>As the number of non-synonymous single nucleotide polymorphisms (nsSNPs), also known as single amino acid polymorphisms (SAPs), increases rapidly, computational methods that can distinguish disease-causing SAPs from neutral SAPs are needed. Many methods have been developed to distinguish disease-causing SAPs based on both structural and sequence features of the mutation point. One limitation of these methods is that they are not applicable to the cases where protein structures are not available. In this study, we explore the feasibility of classifying SAPs into disease-causing and neutral mutations using only information derived from protein sequence.</p> <title>Results</title> <p>We compiled a set of 686 features that were derived from protein sequence. For each feature, the distance between the wild-type residue and mutant-type residue was computed. Then a greedy approach was used to select the features that were useful for the classification of SAPs. 10 features were selected. Using the selected features, a decision tree method can achieve 82.6% overall accuracy with 0.607 Matthews Correlation Coefficient (MCC) in cross-validation. When tested on an independent set that was not seen by the method during the training and feature selection, the decision tree method achieves 82.6% overall accuracy with 0.604 MCC. We also evaluated the proposed method on all SAPs obtained from the Swiss-Prot, the method achieves 0.42 MCC with 73.2% overall accuracy. This method allows users to make reliable predictions when protein structures are not available. Different from previous studies, in which only a small set of features were arbitrarily chosen and considered, here we used an automated method to systematically discover useful features from a large set of features well-annotated in public databases.</p> <title>Conclusion</title> <p>The proposed method is a useful tool for the classification of SAPs, especially, when the structure of the protein is not available.</p>
<title>Availability and requirements</title> <p>A web server based on the proposed method is available online [##UREF##4##26##].</p> <title>Authors' contributions</title> <p>CY conceived of and designed the study, performed the analysis and drafted the manuscript. JH contributed to most of the computation. Both authors read and approved the final manuscript.</p>
<title>Acknowledgements</title> <p>The authors would like to thank Zhi-qian Ye and Liping Wei for providing their datasets and giving assistance.</p>
<fig position="float" id="F1"><label>Figure 1</label><caption><p><bold>Classification performance is improved as the feature selection progresses</bold>. MCC (Matthew's Correlation Coefficient) increases as the number of selected features increases and reaches its maximum when 10 features are selected. The MCC remains unchanged when 11<sup>th </sup>and 12<sup>th </sup>features are selected. When more than 12 features are selected, the MCC slightly decreases.</p></caption></fig> <fig position="float" id="F2"><label>Figure 2</label><caption><p><bold>Comparisons of the ROC curves of the proposed method, SIFT and Panther</bold>. Area under ROC curve is 0.85 for Decision Tree, 0.77 for SIFT and 0.74 for Panther.</p></caption></fig> <fig position="float" id="F3"><label>Figure 3</label><caption><p><bold>ROC curves of the proposed method and others when tested on all SAPs from the Swiss-prot dataset</bold>. Area under ROC curve is 0.75 for Decision Tree, 0.73 for SIFT and 0.70 for Panther.</p></caption></fig>
<table-wrap position="float" id="T1"><label>Table 1</label><caption><p>Performance of the proposed method</p></caption><table frame="hsides" rules="groups"><thead><tr><td/><td align="left">Cross-validation</td><td align="left">Independent test</td><td align="left">Swiss-Prot<sup>1</sup></td></tr></thead><tbody><tr><td align="left">MCC</td><td align="left">0.607</td><td align="left">0.604</td><td align="left">0.42</td></tr><tr><td align="left">Accuracy (%)</td><td align="left">82.6</td><td align="left">82.6</td><td align="left">73.2</td></tr><tr><td align="left">Sensitivity (%) (TP/(TP+FN))</td><td align="left">94.9</td><td align="left">94.7</td><td align="left">84.0</td></tr><tr><td align="left">True Positive Rate (%) (TP/(TP+FP))</td><td align="left">81.6</td><td align="left">81.6</td><td align="left">75.0</td></tr></tbody></table></table-wrap> <table-wrap position="float" id="T2"><label>Table 2</label><caption><p>Selected features</p></caption><table frame="hsides" rules="groups"><thead><tr><td align="left">Feature</td><td align="left">Annotation</td></tr></thead><tbody><tr><td align="left"><italic>is_HLA</italic></td><td align="left">Whether the protein containing the SAP belongs to HLA family [##REF##17384424##18##].</td></tr><tr><td align="left">nor_diff_freq</td><td align="left">Normalized difference between mutant-type residue frequency and wild-type residue frequency.</td></tr><tr><td align="left">DAYM780301</td><td align="left">Log odds matrix for 250 PAMs [##UREF##5##27##]. The value between two amino acids shows how often one amino acid replaces another one in evolution.</td></tr><tr><td align="left">FEND850101</td><td align="left">Structure-Genetic matrix [##REF##6100188##28##]. This matrix takes into account of the structural similarities of amino acids and the genetic code.</td></tr><tr><td align="left">ZHAC000105</td><td align="left">Environment-dependent residue contact energies [##REF##10706611##29##]. The residue contact energies in different structural environment.</td></tr><tr><td align="left">HENS920103</td><td align="left">BLOSUM80 substitution matrix [##REF##1438297##30##]. The value between two amino acids is defined based on the log likelihood of one amino acid substitutes the other by chance in sequence alignment.</td></tr><tr><td align="left">NAKH900106</td><td align="left">Normalized composition from animal [##REF##2235995##31##]. Normalized residue composition calculated from animal mitochondrial proteins.</td></tr><tr><td align="left"><italic>metal_seq_neibor</italic></td><td align="left">The sequence distance between the SAP site and its nearest residue holding the functional site with Feature Key of METAL [##REF##17384424##18##].</td></tr><tr><td align="left">MIYS850103</td><td align="left">Quasichemical energy of interactions in an average buried environment [##UREF##6##32##].</td></tr><tr><td align="left"><italic>modres_seq_neibor</italic></td><td align="left">The sequence distance between the SAP site and its nearest residue holding the functional site with Feature Key of MOD_RES [##REF##17384424##18##].</td></tr></tbody></table></table-wrap>
<inline-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M1" name="1471-2105-9-297-i1" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mo>_</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>m</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mo>−</mml:mo><mml:mi>w</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></inline-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M2" name="1471-2105-9-297-i2" overflow="scroll"><mml:semantics><mml:mrow><mml:msub><mml:mi>f</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>m</mml:mi><mml:mi>u</mml:mi><mml:mi>t</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>−</mml:mo><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow><mml:mrow><mml:mi>i</mml:mi><mml:mi>n</mml:mi><mml:mi>d</mml:mi><mml:mi>e</mml:mi><mml:msub><mml:mi>x</mml:mi><mml:mi>i</mml:mi></mml:msub><mml:mo stretchy="false">(</mml:mo><mml:mi>w</mml:mi><mml:mi>i</mml:mi><mml:mi>l</mml:mi><mml:mi>d</mml:mi><mml:mi>t</mml:mi><mml:mi>y</mml:mi><mml:mi>p</mml:mi><mml:mi>e</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M3" name="1471-2105-9-297-i3" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>n</mml:mi><mml:mi>o</mml:mi><mml:mi>r</mml:mi><mml:mo>_</mml:mo><mml:mi>d</mml:mi><mml:mi>i</mml:mi><mml:mi>f</mml:mi><mml:mi>f</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>m</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi><mml:mo>−</mml:mo><mml:mi>w</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow><mml:mrow><mml:mi>w</mml:mi><mml:mi>t</mml:mi><mml:mo>_</mml:mo><mml:mi>f</mml:mi><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>q</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M4" name="1471-2105-9-297-i4" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>A</mml:mi><mml:mi>c</mml:mi><mml:mi>c</mml:mi><mml:mi>u</mml:mi><mml:mi>r</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>y</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula> <disp-formula><mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" id="M5" name="1471-2105-9-297-i5" overflow="scroll"><mml:semantics><mml:mrow><mml:mi>M</mml:mi><mml:mi>C</mml:mi><mml:mi>C</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>×</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>−</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo>×</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi></mml:mrow><mml:mrow><mml:msqrt><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mi>P</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>P</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">(</mml:mo><mml:mi>T</mml:mi><mml:mi>N</mml:mi><mml:mo>+</mml:mo><mml:mi>F</mml:mi><mml:mi>N</mml:mi><mml:mo stretchy="false">)</mml:mo></mml:mrow></mml:msqrt></mml:mrow></mml:mfrac></mml:mrow></mml:semantics></mml:math></disp-formula>
<table-wrap-foot><p><sup>1</sup>The proposed method was evaluated on SAPs from Swiss-Prot.</p></table-wrap-foot>
<graphic xlink:href="1471-2105-9-297-1"/> <graphic xlink:href="1471-2105-9-297-2"/> <graphic xlink:href="1471-2105-9-297-3"/>
[{"surname": ["Herrgard", "Cammer", "Hoffman", "Knutson", "Gallina", "Speir", "Fetrow", "Baxter"], "given-names": ["S", "SA", "BT", "S", "M", "JA", "JS", "SM"], "article-title": ["Prediction of deleterious functional effects of amino acid mutations using a library of structure-based function descriptors"], "source": ["Proteins: Structure, Function, and Genetics"], "year": ["2003"], "volume": ["53"], "fpage": ["806"], "lpage": ["816"], "pub-id": ["10.1002/prot.10458"]}, {"surname": ["Ferrer-Costa", "Orozco", "Cruz"], "given-names": ["C", "M", "X"], "article-title": ["Use of bioinformatics tools for the annotation of disease-associated mutations in animal models"], "source": ["Proteins: Structure, Function, and Bioinformatics"], "year": ["2005"], "volume": ["61"], "fpage": ["878"], "lpage": ["887"], "pub-id": ["10.1002/prot.20664"]}, {"article-title": ["SAPs from SwissProt"]}, {"surname": ["Witten", "Frank"], "given-names": ["IH", "E"], "source": ["Data Mining: Practical machine learning tools and techniques"], "year": ["2005"], "edition": ["2nd"], "publisher-name": ["San Francisco, Morgan Kaufmann"]}, {"article-title": ["Online server for SAPs prediction"]}, {"surname": ["Dayhoff", "Schwartz", "Orcutt", "Dayhoff MO"], "given-names": ["MO", "RM", "BC"], "article-title": ["A model of evolutionary change in proteins"], "source": ["Atlas of Protein Sequence and Structure"], "year": ["1978"], "volume": ["5"], "publisher-name": ["Washington, D.C., National Biomedical Research Foundation"], "fpage": ["352"]}, {"surname": ["Miyazawa", "Jernigan"], "given-names": ["S", "RL"], "article-title": ["Estimation of effective inter-residue contact energies from protein crystal structures: Quasi-chemical approximation"], "source": ["Macromolecules"], "year": ["1985"], "volume": ["18"], "fpage": ["534"], "lpage": ["552"], "pub-id": ["10.1021/ma00145a039"]}]
BMC Bioinformatics. 2008 Jun 27; 9:297