Scalable Data Mining Algorithms in Computational Biology and BiomedicineView this Special Issue
Research Article | Open Access
Hong-Li Hua, Fa-Zhan Zhang, Abraham Alemayehu Labena, Chuan Dong, Yan-Ting Jin, Feng-Biao Guo, "An Approach for Predicting Essential Genes Using Multiple Homology Mapping and Machine Learning Algorithms", BioMed Research International, vol. 2016, Article ID 7639397, 9 pages, 2016. https://doi.org/10.1155/2016/7639397
An Approach for Predicting Essential Genes Using Multiple Homology Mapping and Machine Learning Algorithms
Investigation of essential genes is significant to comprehend the minimal gene sets of cell and discover potential drug targets. In this study, a novel approach based on multiple homology mapping and machine learning method was introduced to predict essential genes. We focused on 25 bacteria which have characterized essential genes. The predictions yielded the highest area under receiver operating characteristic (ROC) curve (AUC) of 0.9716 through tenfold cross-validation test. Proper features were utilized to construct models to make predictions in distantly related bacteria. The accuracy of predictions was evaluated via the consistency of predictions and known essential genes of target species. The highest AUC of 0.9552 and average AUC of 0.8314 were achieved when making predictions across organisms. An independent dataset from Synechococcus elongatus, which was released recently, was obtained for further assessment of the performance of our model. The AUC score of predictions is 0.7855, which is higher than other methods. This research presents that features obtained by homology mapping uniquely can achieve quite great or even better results than those integrated features. Meanwhile, the work indicates that machine learning-based method can assign more efficient weight coefficients than using empirical formula based on biological knowledge.
Essential genes are those genes which are indispensable for the basic activities of organisms under certain growth conditions . The proteins coded by essential genes are considered to carry out the fundamental biological functions. Therefore, these essential genes are regarded as the basis of life . Knowing more about necessity of genes can help researchers find out the existence form of microbes , construct the minimal gene subset , discover potential drug targets, and design reasonable and effective drugs to resist microbial pathogens . In addition, these genes are more inclined to be related to basic cellular processes such as duplication and translation, which would lead essential genes to be more stringent than nonessential genes when negative (purifying) selection occurs [6, 7]. Because of their tremendous functions in cells, the research of essential genes has become hotspot in bioinformatics and genomics. A series of experimental approaches such as single gene knockouts , conditional knockouts , RNA interference , and transposon mutagenesis  have been provided to identify microbic essential genes. While experimental techniques may be reliable, these methods have significant shortcomings, such as high cost and long duration.
As an alternative way, computational methods do not have the above-mentioned drawbacks. Hence, some researchers attempt to use computational techniques combining with biological characteristics to identify essential genes. To some extent, some of these methods have obtained satisfactory results. Deng et al. trained classifier on the basis of several biological features including intrinsic and context-dependent genomic features. The results of their method yielded AUC scores between 0.86 and 0.93 through tenfold cross-validation test in the same organism and 0.69 to 0.89 for cross organism predictions . Song et al. used -curve and some other features which derived from sequences combining with their linear method to predict essential genes. They acquired AUC scores between 0.8042 and 0.9319 in 12 organisms . These biological features often used can be summarized as three types: intrinsic genomic features like GC content, derived features from sequence like codon adaption index, experimental data like gene expression profile, as well as other features like gene ontology and functional gene network [14–18]. Although these features are associated with gene essentiality, the majority of them cannot be collected or available in most of microbes, nor does every feature have high predictive power in identification of essential genes. Besides, these features may increase biological redundancy. Therefore, most of the methods based on various biological characteristics just could be developed in merely a handful of species. However, essential genes tend to be conserved during the long-term evolution ; thus sequence alignment is of great significance for molecular function prediction . Considering these factors, our group previously developed a universal tool named Geptop (gene essentiality prediction tool based on orthology and phylogeny) to predict gene essentiality . This approach uses reciprocal best hit (RBH) method to obtain the results of homology mapping and considers the distance of phylogeny as the weight of orthology variables. Through a series of tests, Geptop, a method designed only based on biological knowledge, has obtained quite better results than those based on integrated features.
In this study, we attempted to investigate the optimized weight and find whether it can further improve the predictions or not. In recent years, the machine learning-based methods have shown significant performance in many prediction researches . Therefore, we put forward a new approach to identify essential genes based on multiple homology mapping and machine learning technique. For a given organism, the greatest weight is the evolutionary distance between it and its closest related organism in Geptop. However, in our method, it was measured by the feature with the best ability to distinguish positive and negative sample sets.
2. Materials and Methods
2.1. Data Sources
Annotations of essential genes were downloaded from the latest version of Database of Essential Genes (DEG) at http://tubic.tju.edu.cn/deg/. 39 bacterial essential gene sets are included in DEG database, but not all of them are reliable because of the limitations of wet-lab technologies. Additionally, an organism may have different batches of data accompanying with different accuracy, and some genomes contain many conditional essential genes which are specific in these organisms. Therefore, we excluded those inappropriate datasets and finally chose 25 essential gene sets as positive datasets. Meanwhile, we downloaded another annotation data of Escherichia coli K_12 (E. coli) from Profiling of E. coli Chromosome (PEC)  for extra study. Those genes, which cannot be found in essential gene sets, are regarded as nonessential genes and are used to construct negative datasets for each organism. Therefore, each gene of the target species was assigned a Boolean value to label the essentiality (essential: +1; nonessential: −1). The complete protein coding sequences with fasta format of 25 organisms were obtained from NCBI Genomes. We listed all species used in this work in Table 1. In order to describe these species conveniently, we gave an abbreviated name for each of them (Table 1).
|The number of essential genes and total genes are counted after filtering unmatched data.|
2.2. Homology Mapping
Essential genes tend to be more conserved than nonessential genes in the process of long-term evolutionary. Hence, they should be kept in most of the bacteria . This property of essential genes constitutes the basis of our method. In our work, we used the method of reciprocal best hit (RBH) to identify orthologs between the selected organisms through pair-wise comparison. For two given organisms, one was used as the query species Q and the other was used as the referential species R. Firstly, we queried an (coding DNA sequence) of Q against all in R by Blastp program with a default -value threshold of 10 and yielded a set of hits . Then, we queried with the lowest -value in against all in Q by the same way and yielded a set of hits . A pair of proteins (, ) are considered orthologs if we queried with the lowest -value in . Therefore, is assumed as orthologous-essential gene if the referential gene is annotated as essential by experimental methods in species R. And the value of sample for feature R is marked as 1 if has orthologous-essential gene in species R. Otherwise, it is marked as 0. Finally, a gene can be represented by a series of binary values. Specially, for training sets, the feature names are described by the names of referential species, and binary vectors are values of these features.
2.3. Method of Geptop
Geptop calculates gene essentiality through combining the features which computed by homology mapping with corresponding evolutionary distance between query species and its referential species. The evolutionary distance is calculated by composition vector (CV) ; it is employed as the weight of orthologous-essential gene. For a given genome, Geptop took multiple homology mapping to obtain the orthologous-essential genes of different referential species. Then, it computed the CV distances between the query genome and the other referential ones. The gene essentiality of the given organism is calculated by the following equation:where represents the essentiality score of th gene of query species, represents the essentiality of the optimal orthologous gene of th query gene in th referential species, is the distance between the query species and the th referential species, and is the total number of referential species. Thus, Geptop method can decide whether a gene is essential or not according to the essentiality score.
2.4. Method Based on Sequence Feature and Machine Learning Algorithm
2.4.1. Support Vector Machine
Support vector machine (SVM) , an efficient machine learning method, has been widely used in classification and pattern recognition. It adopts the principle of structural risk minimization and belongs to supervised learning method. SVM maps features into a high-dimensional feature space by kernel function. In the high-dimensional space, the samples with different attributions can be separated easily. In the present work, we adopted LibSVM  to perform SVM algorithm with RBF kernel function. It gave evaluation index for each feature that differed from the weight given by Geptop method.
2.4.2. Feature Selection
In order to measure the contribution of each feature in a test process, we utilized -score algorithm  to estimate the importance of them. -score is a simple and quite effective arithmetic to discriminate two sets of real data. The larger the score is, the more significant contribution the feature makes. For training vectors the -score is defined as followings:where and are the number of positive and negative samples, respectively; , , and are the mean of the th feature of the total, positive and negative samples, respectively; is the th feature of the th positive sample; is the th feature of the th negative sample.
2.4.3. Classifier Design and Performance Evaluation
For a species under test, the homology mapping was implemented between the query species and other 24 organisms, and then 24 features were obtained to train the classifier. We used the classic machine learning method SVM to train the model and predict essential genes. Gaussian kernel function was selected to project the original features into a high-dimensional space. Gridding search method was adopted to search the best penalty parameter and . Cross-validation and receiver operating characteristic (ROC) curve is the usual performance evaluation method for predictions . Therefore, we used the area under ROC curve (AUC) of tenfold cross-validation to evaluate the performance of our classifier. For 10-fold cross-validation, the training data were randomly divided into 10 equal parts. Nine parts were used to train the classifiers and the remaining part was used for testing. This process was repeated until each part was taken as test set. For prediction in cross organisms, we chose the feature sets of the closest organism or them of the greatest contributed feature/organism to train the model and used the same characteristic variables of test organism to make prediction. The predictions were compared with the known gene essentialities which have been determined by experimental method.
3.1. Evolutionary Distance and Orthology in Cross Species
If two organisms have closer evolutionary distance, they may share more orthologous genes or more common essential genes, relatively. We used an online web server CVTree  to establish phylogenetic tree for the selected 25 species. The phylum each organism belongs to and the distance relationships among them were illustrated in Supplementary Data Figure in Supplementary Material available online at http://dx.doi.org/10.1155/2016/7639397. We discovered that only one organism belongs to Actinobacteria, other 24 organisms are from 4 different phyla, and each phylum has more than one organism.
Essential genes are always inclined to be conserved because of their important functions, while conserved genes across species are not necessarily essential. We compared the number of conserved genes and essential genes between two organisms to illustrate the orthologous relationships across species (Figure 1). We analyzed these relationships in two groups. One pair contains relatively closely related organisms: ESC and SAS (Figure 1(a)), and the other pair contains relatively distantly related organisms: ESC and BAT (Figure 1(b)). The evolutionary distances of SAS-ESC and BAT-ESC are 0.3273 and 0.4976, respectively. There are 3204 orthologous genes between ESC and SAS, in which there are 244 common essential genes, accounting for around 77.39% and 5.89% in the total number of ESC genes, respectively. In the other group, 1457 genes are orthologous between ESC and BAT, in which there are 123 common essential genes, accounting for only 35.19% and 2.97% in the total number of ESC genes, respectively. These two results exemplified that the closer the evolutionary distance between species is, the more orthologous genes or common essential genes they would share. Meanwhile, an organism may share different essential genes with different organisms. Hence, we need to use multiple genomes to implement homology mapping, which we called multiple homology mapping.
3.2. Classifier Training towards 25 Genomes and 10-Fold Cross-Validations of the Classifier
We gave the flowchart to display how this work was implemented in Figure 2. In this study, features we used were derived from protein sequences via homology mapping, which are easier to be acquired compared with other various biological features. Totally, 24 features were used as input variables for SVM classifier. The input data contained 24 features and the class labels for the species under test. Each genome was taken as the test species, and each of their AUC score of 10-fold cross-validations was acquired. All of their results of prediction yielded AUC scores between 0.5700 and 0.9716 (Figure 3) and accuracy scores between 0.7980 and 0.9805 (Supplementary Data Table ). In addition, the AUC score of ESC_PEC (E. coli) whose data were obtained from PEC database is 0.9864 by this classifier. Previously, Deng et al.  got AUC score of 0.93 by 10-fold cross-validation for the same dataset through combining 4 machine learning methods and 13 features including codon bias index, Aromaticity, and Paralogy. Absolutely, our method achieved better performance than theirs. In addition, more than 70% of the bacteria exceed AUC score of 0.80, and merely 12% of all are less than 0.70. These results demonstrate that our classifiers have quite great performance.
3.3. Predictions after Feature Selection
In the above work, all features obtained by homology mapping were utilized to train the classifiers, but not every feature has high predictive power for identification of essential genes. Therefore, ranking the features in order and filtering out the useless features played an important role in prediction . We used the method of feature selection to choose appropriate feature subsets to reappraise the performance of classifiers. Based on -score algorithm , we got a vector composed of 24 feature scores in descending order for an organism under test. Another feature selection method named DX score  was also applied to measure feature score, and the same order of features were acquired. It indicated that the features’ order we obtained was reliable. Feature subsets were constructed through appending a feature one by one in accordance with the descending order, and each feature subset was utilized to train and test the model. Finally, the optimal feature subset and its predictions would be chosen on the basis of AUC score. After selecting optimal feature subsets, most of predictions have corresponding improvement. The AUC scores of 8 species were improved by more than 1%, and the average AUC score was improved around 1% among 25 species comparison with the results of using all features. In addition, contribution score of each feature was obtained by -score. For each organism under test, we analyzed the correlation between feature scores and evolutionary distances through Pearson correlation analysis (Table 2). We discovered that 22 species among all presented negative correlations, in which 15 results presented significant negative correlations. That is to say the importance of features evaluated by machine learning method is consistent with the evolutionary distance between them in general.
| represents that the correlation is significant at the 0.05 level; represents that the correlation is significant at the 0.01 level.|
3.4. Predicting Essential Genes across Organisms
It is necessary to use the suitable model to predict essential genes across distantly related bacteria. The relatively closely related organisms may have similar patterns in developing model for predicting gene essentiality when using orthologs to some extent. For a species with unknown gene essentiality, using the features of closest organism as training set to train model is available. However, the closest species may not be the most important contributor in machine learning methods. Besides, if the data quality of this species is poor, it could cause bad effects for the classifier and the classifier could not give the best predictions. Therefore, we chose the characteristic set of closest species and the characteristic set of the greatest contributor to train the model, respectively. The better outputs of these diverse training set were chosen as the results of prediction. For example, Salmonella enterica serovar Typhimurium LT2 (SAL) is the closest related bacterium for ESC, but the classifier built by its features made a low AUC score of 0.7894. This may be related to the low data quality of SAL itself (Supplementary Data Table ). Nevertheless, we chose the features of Salmonella enterica serovar Typhi SL1344 (SAS) as training set to train model for predicting essential genes of ESC, because feature SAS has maximum -score among all features of ESC. AUC score of 0.9552 and precision (or PPV) of 0.7330 were acquired, and the classifier identified 258 true essential genes from its 352 positive outputs. These two values are greater than the AUC score of 0.9470 and precision (or PPV) of 0.6574 through Geptop method, which identified 236 true essential genes from its 359 positive outputs. We applied this method to implement interspecies prediction among other 24 organisms. As a result, AUC scores between 0.5957 and 0.9552 were obtained for 25 bacteria except ESC_PEC (Figure 4, Supplementary Data Table ). For 26 genomes including ESC_PEC, 18 results of prediction are better than Geptop. And the average AUC was improved by 1.14% compared with Geptop.
A newly determined essential gene set of Synechococcus elongatus PCC 7942 (SYE) by experimental technology are acquirable for independent testing . Totally, 674 genes are annotated as essential in its genome. This bacterium belongs to Cyanophyta, a quite different phylum compared with the bacteria already used in this study. We collected this dataset to further evaluate the performance of our classifier. The evolutionary distances between SYE and the existing organisms were calculated by composition vector (CV) method. The nearest species was determined as Caulobacter crescentus NA1000 (CAC). We chose the features of CAC to train a classifier and obtained values of the same features of SYE as test set through homology mapping between it and other 24 species except CAC. Through SVM, we achieved AUC score of 0.7855 (Figure 5) and precision (or PPV) of 0.8105. In order to assess performance of machine learning method, Geptop method was implemented to predict essential genes on SYE, and then it obtained AUC score of 0.7578 and precision (or PPV) of 0.8484. Although the precision of Geptop is higher than that of SVM, SVM method identified 325 true essential genes from its 401 positive outputs, which are more than 263 true essential genes identified by Geptop.
We make predictions based on gene essentialities which have been determined by experimental technology. There is no doubt that the results of prediction would be influenced by quality of experimental data. For example, if insertion was avoided accidentally, transposon mutagenesis technique would be likely to mislabel short genes . Therefore, the reason why those three species (CAJ, SAL, and SA14028S) have AUC lower than 0.70 may be that a mass of essential genes were mislabeled when they were identified by experimental techniques. This has been discussed in Geptop. Additionally, according to the fact that few contributions SA14028S provided for almost all organisms and few contributions these features provided for it, we can further presume that the data of this species have low quality.
Geptop gave weights for features only based on evolutionary distance, which would ignore the data quality. Our machine learning method measures the features from an integrated view. In order to investigate the reason why our method performs better than Geptop, we ranked the features based on theirs abilities of differentiate between positive and negative sample sets, which were measured by -score in our method, and we also ranked them based on weights which were measured by evolutionary distance in Geptop. The rank changes of features from Geptop to SVM were calculated. We analyzed the relationships between AUC scores of 10-fold cross-validation and rank changes using Pearson correlation method (Table 3). We find that 23 among 25 results present significant positive correlations. It indicates that rank changes of features from Geptop to SVM are consistent with AUC values. Taking ACA as example (Supplementary Data Table ), the most important feature in Geptop is ranked as 11th in SVM. Specially, the 6th important feature in Geptop is ranked as 24th in SVM. In addition, this feature has no contribution for predicting. In truth, the 24th feature for ACA in SVM is SA14028S, which has been discussed that it has low data quality in the above paragraph. Furthermore, the important features in Geptop with relatively high AUC like ESC and SAS have no or few rank changes. In other words, our method can take the predictive power of every feature into full account. Simultaneously, as a machine learning method, SVM has its inherent advantages. For instance, the final decision function is dominantly determined by a few support vectors, which not only can help us acquire key samples, but also has good robustness. Thus, our method can achieve better predictions than Geptop; the latter makes prediction completely depending on biological knowledge.
| represents that the correlation is significant at the 0.05 level; represents that the correlation is significant at the 0.01 level.|
Our classifier is designed based on RBH method, which can reflect substantive characteristics of orthologous sequence. Although the homology mapping method may ignore the species-specific essential genes, it still can identify reasonable number of essential genes. Superiority of multiple homology mapping has been presented in Geptop, which acquired satisfactory results in predicting essential genes. Besides, these features could be extracted for almost all sequenced bacterial genomes. We utilized this method incorporating with SVM to train classifier and predict essential genes, and then the classifier achieved better performance than Geptop. It probably gives the credit to the fact that our method can measure predictive ability of each feature through machine learning method, which differs from Geptop that only considers evolutionary distance; thus our method can train the better model. Geptop has been designed as a web server; our method also has potential to be developed as a tool to provide service for users.
In conclusion, through multiple homology mapping and machine learning method, we provide a significant alternative method to predict essential genes. The results of prediction yield higher AUC scores than those integrated approaches as well as Geptop method. Simultaneously, this work reveals that machine learning method may perform better than the method using empirical formula; the latter was developed completely based on biological knowledge. With more reliable and available experimental essential gene sets, the performance of our method will be improved to an even better level.
The authors declare that there are no competing interests regarding the publication of this paper.
The authors gratefully acknowledge Dr. Shuo Liu in University of Electronic Science and Technology for checking the paper and kindly providing some suggestions.
The Supplementary material lists detailed information of main results of this work in PDF document format, including accuracy scores of 10-fold cross-validation, the evolutionary distance of ESC toward other 24 species and F-scores of 24 features of ESC, AUC scores of interspecies prediction obtained through SVM and Geptop method respectively, the feature ranks of organism ACA acquired through SVM and Geptop method respectively, as well as phylogenetic tree for the selected 25 organisms.
- C.-T. Zhang and R. Zhang, “Gene essentiality analysis based on DEG, a database of essential genes,” Methods in Molecular Biology, vol. 416, pp. 391–400, 2007.
- K. Kobayashi, S. D. Ehrlich, A. Albertini et al., “Essential Bacillus subtilis genes,” Proceedings of the National Academy of Sciences of the United States of America, vol. 100, no. 8, pp. 4678–4683, 2003.
- M. Juhas, D. R. Reuß, B. Zhu, and F. M. Commichau, “Bacillus subtilis and Escherichia coli essential genes and minimal cell factories after one decade of genome engineering,” Microbiology, vol. 160, pp. 2341–2351, 2014.
- M. Itaya, “An estimation of minimal genome size required for life,” FEBS Letters, vol. 362, no. 3, pp. 257–260, 1995.
- J. E. Dickerson, A. Zhu, D. L. Robertson, and K. E. Hentges, “Defining the role of essential genes in human disease,” PLoS ONE, vol. 6, no. 11, Article ID e27368, 2011.
- I. K. Jordan, I. B. Rogozin, Y. I. Wolf, and E. V. Koonin, “Essential genes are more evolutionarily conserved than are nonessential genes in bacteria,” Genome Research, vol. 12, no. 6, pp. 962–968, 2002.
- H. Luo, F. Gao, and Y. Lin, “Evolutionary conservation analysis between the essential and nonessential genes in bacterial genomes,” Scientific Reports, vol. 5, article 13210, 2015.
- G. Giaever, A. M. Chu, L. Ni et al., “Functional profiling of the Saccharomyces cerevisiae genome,” Nature, vol. 418, pp. 387–391, 2002.
- T. Roemer, B. Jiang, J. Davison et al., “Large-scale essential gene identification in Candida albicans and applications to antifungal drug discovery,” Molecular Microbiology, vol. 50, no. 1, pp. 167–181, 2003.
- L. M. Cullen and G. M. Arndt, “Genome-wide screening for gene function using RNAi in mammalian cells,” Immunology and Cell Biology, vol. 83, no. 3, pp. 217–223, 2005.
- Y. Veeranagouda, F. Husain, E. L. Tenorio, and H. M. Wexler, “Identification of genes required for the survival of B. fragilis using massive parallel sequencing of a saturated transposon mutant library,” BMC Genomics, vol. 15, article 429, 2014.
- J. Deng, L. Deng, S. Su et al., “Investigating the predictability of essential genes across distantly related organisms using an integrative approach,” Nucleic Acids Research, vol. 39, no. 3, pp. 795–807, 2011.
- K. Song, T. Tong, and F. Wu, “Predicting essential genes in prokaryotic genomes using a linear method: ZUPLS,” Integrative Biology, vol. 6, no. 4, pp. 460–469, 2014.
- J. Cheng, W. Wu, Y. Zhang et al., “A new computational strategy for predicting essential genes,” BMC Genomics, vol. 14, no. 1, article 910, 2013.
- A. M. Gustafson, E. S. Snitkin, S. C. J. Parker, C. DeLisi, and S. Kasif, “Towards the identification of essential genes using targeted genome sequencing and comparative analysis,” BMC Genomics, vol. 7, article 265, 2006.
- M. L. Acencio and N. Lemke, “Towards the prediction of essential genes by integration of network topology, cellular localization and biological process information,” BMC Bioinformatics, vol. 10, article 1471, p. 290, 2009.
- Y. Xu, M. Guo, X. Liu, C. Wang, and Y. Liu, “Inferring the soybean (Glycine max) microrna functional network based on target gene network,” Bioinformatics, vol. 30, no. 1, pp. 94–103, 2014.
- Y. Xu, M. Guo, W. Shi, X. Liu, and C. Wang, “A novel insight into Gene Ontology semantic similarity,” Genomics, vol. 101, no. 6, pp. 368–375, 2013.
- C. G. Acevedo-Rocha, G. Fang, M. Schmidt, D. W. Ussery, and A. Danchin, “From essential to persistent genes: a functional approach to constructing synthetic life,” Trends in Genetics, vol. 29, no. 5, pp. 273–279, 2013.
- Q. Zou, Q. Hu, M. Guo, and G. Wang, “HAlign: fast multiple similar DNA/RNA sequence alignment based on the centre star strategy,” Bioinformatics, vol. 31, no. 15, pp. 2475–2481, 2015.
- W. Wei, L.-W. Ning, Y.-N. Ye, and F.-B. Guo, “Geptop: a gene essentiality prediction tool for sequenced bacterial genomes based on orthology and phylogeny,” PLoS ONE, vol. 8, no. 8, article e72343, 2013.
- Q. Zou, J. Li, Q. Hong et al., “Prediction of microRNA-disease associations based on social network analysis methods,” BioMed Research International, vol. 2015, Article ID 810514, 9 pages, 2015.
- Y. Yamazaki, H. Niki, and J.-I. Kato, “Profiling of Escherichia coli Chromosome database,” in Microbial Gene Essentiality: Protocols and Bioinformatics, A. L. Osterman and S. Y. Gerdes, Eds., vol. 416 of Methods in Molecular Biology™, pp. 385–389, 2008.
- F. M. Mobegi, A. Zomer, M. I. de Jonge, and S. A. van Hijum, “Advances and perspectives in computational prediction of microbial gene essentiality,” Briefings in Functional Genomics, 2016.
- J. Qi, B. Wang, and B.-I. Hao, “Whole proteome prokaryote phylogeny without sequence alignment: a K-string composition approach,” Journal of Molecular Evolution, vol. 58, no. 1, pp. 1–11, 2004.
- E. Byvatov and G. Schneider, “Support vector machine applications in bioinformatics,” Appl Bioinformatics, vol. 2, no. 2, pp. 67–77, 2003.
- M. Pirooznia and Y. Deng, “SVM Classifier—a comprehensive java interface for support vector machine classification of microarray data,” BMC Bioinformatics, vol. 7, supplement 4, article S25, 2006.
- Y.-W. Chen and C.-J. Lin, “Combining SVMs with various feature selection strategies,” Studies in Fuzziness and Soft Computing, vol. 207, pp. 315–324, 2006.
- Q. Zou, J. Zeng, L. Cao, and R. Ji, “A novel features ranking metric with application to scalable visual and bioinformatics data classification,” Neurocomputing, vol. 173, pp. 346–354, 2016.
- Z. Xu and B. Hao, “CVTree update: a newly designed phylogenetic study platform using composition vectors and whole genomes,” Nucleic Acids Research, vol. 37, no. 2, pp. W174–W178, 2009.
- H. Tan, J. Bao, and X. Zhou, “A novel missense-mutation-related feature extraction scheme for ‘driver’ mutation identification,” Bioinformatics, vol. 28, no. 22, pp. 2948–2955, 2012.
- B. E. Rubin, K. M. Wetmore, M. N. Price et al., “The essential gene set of a photosynthetic organism,” Proceedings of the National Academy of Sciences of the United States of America, vol. 112, no. 48, pp. E6634–E6643, 2015.
- S. Y. Gerdes, M. D. Scholle, J. W. Campbell et al., “Experimental determination and system level analysis of essential genes in Escherichia coli MG1655,” Journal of Bacteriology, vol. 185, no. 19, pp. 5673–5684, 2003.
Copyright © 2016 Hong-Li Hua et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.