Skip to main content
  • Research article
  • Open access
  • Published:

BLProt: prediction of bioluminescent proteins based on support vector machine and relieff feature selection



Bioluminescence is a process in which light is emitted by a living organism. Most creatures that emit light are sea creatures, but some insects, plants, fungi etc, also emit light. The biotechnological application of bioluminescence has become routine and is considered essential for many medical and general technological advances. Identification of bioluminescent proteins is more challenging due to their poor similarity in sequence. So far, no specific method has been reported to identify bioluminescent proteins from primary sequence.


In this paper, we propose a novel predictive method that uses a Support Vector Machine (SVM) and physicochemical properties to predict bioluminescent proteins. BLProt was trained using a dataset consisting of 300 bioluminescent proteins and 300 non-bioluminescent proteins, and evaluated by an independent set of 141 bioluminescent proteins and 18202 non-bioluminescent proteins. To identify the most prominent features, we carried out feature selection with three different filter approaches, ReliefF, infogain, and mRMR. We selected five different feature subsets by decreasing the number of features, and the performance of each feature subset was evaluated.


BLProt achieves 80% accuracy from training (5 fold cross-validations) and 80.06% accuracy from testing. The performance of BLProt was compared with BLAST and HMM. High prediction accuracy and successful prediction of hypothetical proteins suggests that BLProt can be a useful approach to identify bioluminescent proteins from sequence information, irrespective of their sequence similarity. The BLProt software is available at


Bioluminescence is an enchanting process in which light is produced by a chemical reaction within an organism [1, 2]. Bioluminescence is found in various organisms like ctenophora, bacteria, certain annelids, fungi, fish, insects, algae, squid, etc. Most of these organisms are found in marine, freshwater, and terrestrial habitats [24]. The bioluminescence mechanism involves two chemicals, namely luciferin, a substrate, and the enzyme luciferase [1, 5]. Luciferase catalyses the oxidation of luciferin, resulting in light and an intermediate called oxyluciferin. Sometimes, the luciferin catalyzing protein (the equivalent of a luciferase) and a co-factor such as oxygen are bound together to form a single unit called photoprotein. This molecule is triggered to produce light when a particular type of ion is added to the system. The proportionality of the light emission makes a clear distinction between a photoprotein and a luciferase [5]. Photoproteins are capable of emitting light in proportion to the amount of the catalyzing protein, but in luciferase-catalyzed reactions, the amount of light emitted is proportional to the concentration of the substrate luciferins [2].

Different creatures produce different colors of light, from violet through red [3, 6]. The different colors of light produced are often dependent on the roles the light plays, the organism in which it is produced, and the varieties of chemicals produced. The dominant color on land is green, because it reflects best against green plants. The most common bioluminescent color in the ocean is blue. This color transmits best through sea water, which can scatter or absorb light.

Bioluminescence serves a variety of functions, but many of them are still unknown. The known functions include camouflage, finding food, attraction of prey, attraction of mates, repulsion by way of confusion, signaling other members of their species, confusing potential predators, communication between bioluminescent bacteria (quorum sensing), illumination of prey, burglar alarm, etc [35].

The application of bioluminescence promises great possibilities for medical and commercial advances. Bioluminescent proteins serve as invaluable biochemical tools with applications in a variety of fields including gene expression analysis, drug discovery, the study of protein dynamics and mapping signal transduction pathways, bioluminescent imaging, toxicity determination, DNA sequencing studies, estimating metal ions such as calcium, etc [714].

The detailed analysis of bioluminescence proteins helps to understand many of the functions which are still unknown and also helps to design new medical and commercial applications. Due to advances in sequencing technologies, huge amount of data is available in various databases [15]. Despite tremendous progress in the annotation of protein, there are no existing online tools available for the prediction of bioluminescent proteins using primary protein sequences.

A Support Vector Machine (SVM) is a supervised learning algorithm, which has been found to be useful in the recognition and discrimination of hidden patterns in complex datasets [16]. SVM has been successfully applied in various fields of computational biology, e.g., protein sequence/structure analysis, micro-array and gene expression analysis [1618].

In this work, we present a novel prediction method that uses a Support Vector Machine (SVM) and physicochemical properties to predict bioluminescent proteins. So far, bioinformatics and statistical learning methods like Support Vector Machine and Random Forest have not been explored for the prediction of bioluminescent proteins. In this paper, we report a SVM approach to identify bioluminescent proteins from sequence information, irrespective of the sequence similarity.

Results and Discussion

Performance of similarity based search using PSI-BLAST

Similarity search methods play a vital role in the classification of proteins. PSI-BLAST is the most popular similarity based search method for searching sequence databases [19]. PSI-BLAST search for each query sequence was performed against the database of 441 bioluminescent proteins that were used for the training and testing. Three iterations of PSI-BLAST were carried out at a cut-off E-value of 0.001. It was observed that 280 bioluminescent proteins showed similarity (BLAST hit) with other bioluminescent protein sequences (evalue-0.001). The performance of the sequence similarity method drops when there is no significant sequence similarity between two proteins. Hence, such an alignment-based method would rarely yield satisfactory predictions. Therefore, there is a need for alignment-free methods (machine learning models) for predicting bioluminescent proteins.

Prediction of bioluminescent proteins by BLProt

A SVM classifier was applied to predict bioluminescent proteins. Each sequence was encoded by 554 features. The detailed flowchart of our work is shown in Figure 1. The model was trained with a dataset containing 300 bioluminescent protein sequences and 300 non-bioluminescent protein sequences. BLProt achieved 75.16% training accuracy (5 fold cross-validations) with all of the 544 physicochemical properties (Table 1).

Figure 1
figure 1

Workflow of BLProt.

Table 1 Performance of the SVM using different feature subsets selected by ReliefF

To identify the most prominent features, we carried out feature selection with three different filter approaches, ReliefF, Info Gain, and mRMR. We selected five different feature subsets by decreasing the number of features, and the performance of each feature subset was evaluated (see Table 1, Table 2, and Table 3). The best performance of 80% training accuracy was achieved with ReliefF selecting 100 features. Hence, this is chosen as the final model for our work.

Table 2 Performance of the SVM using different feature subsets selected by Info Gain
Table 3 Performance of the SVM using different feature subsets selected by mRMR

After training, we tested our algorithm on the test dataset consisting of 141 bioluminescent protein sequences and 18202 non-bioluminescent proteins sequences. The maximum accuracy of 80.06% with 74.47% sensitivity and 84.21% specificity was obtained using the top 100 features (ReliefF, Table 1).

Figure 2 presents a chart with the true positive rates and false positive rates on the test data at different thresholds for the classifiers using all the features and the top 100 features, respectively (ReliefF). The area under curve for all features was 0.79 and for the top 100 features was 0.87, respectively.

Figure 2
figure 2

ROC Plot for SVM models using all and the top 100 features (ReliefF).

Comparison of BLProt with HMM and BLAST

The performance of BLProt was compared with other sequence search methods, namely HMM and PSI-BLAST using 141 bioluminescent proteins [19, 20]. PSI-BLAST search for each sequence was carried out against the Swissprot database with an E value of 0.1. HMM search for each query sequence was performed against the HMM profile obtained from the Pfam database (Pfam release 23) [21]. Out of 141 proteins, 114 proteins were correctly predicted by BLProt. PSI-BLAST and HMM correctly predicted 99 and 76 proteins, respectively.

Our algorithm was further evaluated by 9 hypothetical proteins obtained from the INTERPRO, CDD and KEGG databases [2224] (Table 4). Our approach correctly predicted all proteins as bioluminescent proteins. The performance of our algorithm was compared with PSI-BLAST and HMM [19, 20]. Out of these 9 proteins, the PSI-BLAST search retrieved bioluminescent protein hits from the Swissprot database for only 4 proteins. No hits were found for the remaining 5 proteins. Similarly, HMM search against the Pfam database returned no hits for 3 proteins. This result indicates that BL-Prot is a useful approach for predicting bioluminescent proteins from sequence information in the absence of sequence similarity.

Table 4 Prediction result for 9 potential Bioluminescent proteins

Comparison with other machine learning methods

The proposed SVM model was compared with several state-of-the-art classifiers such as J4.8, PART, Random Forest, Adaboost and IBK [2529]. We compared the performance of BLProt with the other approaches using the same feature subset (top 100 features from ReliefF). All models were tested on the test dataset containing 141 positive and 18202 negative sequences. The results are shown in Table 5. The prediction accuracy of BLProt is about 7% and 12% higher than that of J4.8 and PART, respectively. Although the sensitivity of BLProt, Random Forest and IBK is comparable, BLProt is superior in specificity and concerning the MCC values.

Table 5 Comparison of BLProt with other machine learning methods


Bioluminescence, the chemically-induced production of light within a living organism, is a process which varies among organisms. The application of bioluminescent proteins has wide medical and commercial values, which explains the interest for the identification of novel bioluminescent proteins. In this study, we developed a method for predicting bioluminescent proteins from its primary sequence using ReliefF coupled with SVM. BLProt will help the experimental biologist to predict bioluminescence from a protein sequence and, thus, help to avoid unnecessary experiments. The BLProt program and dataset is available at



We obtained 300 bioluminescent proteins from seed proteins of the Pfam database [21]. To enrich the dataset, we performed PSI-BLAST search against non-redundant sequence database with stringent threshold (E-value 0.01) [19]. Redundant sequences that have >=40% sequence similarity were removed from the dataset using CD-HIT [30]. After careful manual examination, a total of 441 bioluminescent proteins were selected for the positive dataset.

Training set

  1. 300

    bioluminescent proteins were selected from 441 bioluminescent proteins for the positive dataset. 300 non-bioluminescent proteins for the negative set were randomly taken from seed proteins of Pfam protein families, which are unrelated to bioluminescent proteins.

Test set

The remaining 141 bioluminescent proteins served as a positive dataset for testing. The negative dataset was created from the seed proteins of non-bioluminescent proteins, which are selected from seed proteins of non-bioluminescent protein Pfam protein families [21]. The negative sequences present in the training dataset were removed. Furthermore, non-bioluminescent protein domains with less than 40 amino acids were excluded from the negative set. Finally, the test dataset consisted of 141 bioluminescent proteins and 18202 non-bioluminescent proteins.

The steps of the Algorithm

The following steps were performed and are described in detail below:

  1. 1.

    Get the protein sequence data from the Pfam database.

  2. 2.

    Assign class labels: bioluminescent proteins = +1 (positive class); non-bioluminescent proteins = -1 (negative class).

  3. 3.

    Convert all the sequences to numerical equivalents based on physicochemical properties

  4. 4.

    Get the top 100 features from ReliefF feature selection algorthim.

  5. 5.

    Partition the data into training and test sets.

  6. 6.

    Run the SVM classifier on the training set.

  7. 7.

    Run the SVM classifier on the test set to assess the generalization.

Representation of the proteins as vectors of physicochemical properties

The first step is the conversion of the protein sequence into a vector of physicochemical properties. For this purpose we used the AAindex. The AAindex is a database of numerical indices representing various physicochemical and biochemical properties of amino acids and pairs of amino acids [31]. This database provides a collection of 544 such physicochemical properties. We converted each protein sequence into a 544 dimensional feature vector. Each physicochemical property value is determined by the sum of the physicochemical property values of all residues of the sequence, divided by the length of the sequence.

Support vector machines for classification

The Support Vector Machine (SVM) has been successfully used to solve various problems in bioinformatics [1618, 3234]. The SVM is a supervised machine learning method which is based on statistical learning theory [35]. When used as a binary classifier, the SVM constructs a hyperplane in a kernel feature space that acts as the decision surface between the two classes. The SVM maximizes the margin of separation between the hyperplane and those data points nearest to it. The details of the formulation and solution methodology of the SVM for binary classification tasks can be found in [35, 36]. Only relevant details are provided here.

Let x i Rn , i = 1, 2,...,n be training instances and y i {-1, +1} be their corresponding target class labels.

Given a new instance x, the decision on its class affiliation can be made depending upon the sign of the function

f ( x ) = i = 1 m y i α i K ( x i , x ) + b

where m is the number of input instances having non-zero values of the Lagrange multipliers (α i )(usually a subset of n known as the support vectors). The αi are obtained by solving a quadratic optimization problem on the training instances. b is the bias term.

K(x i , x) denotes the kernel function. In the present study, we used the Gaussian kernel, defined by

K ( x i , x j ) = exp ( - γ x i - x j 2 )

where γ defines the width of the kernel.

All computations were performed using the LIBSVM - 2.81 standard package [37]. The user-defined parameters, i.e. the kernel parameter γ and the regularization parameter C (allows one to trade off training error vs. model complexity), were optimized by a grid search. A small value for C corresponds to a small model complexity and guarantees a small deviation of the test error from the training error. However, the training error might be large. A large C provides small training errors, however, with an increase of the model complexity the probability that the test error is significantly worse than the training error increases. A C going to infinity leads to a hard-margin SVM [38]. The grid search was done using a 5-fold cross-validation. For that purpose the dataset was randomly divided into 5 subsets. The training and validation was carried out 5 times for each model using one distinct set for validation and the remaining four for training. The performance of the model, as reported in Table 1, is the average performance over these 5 sets.

Feature Selection

In this work, the main purpose of conducting feature selection is to remove possible redundant features from the original feature set. By redundant, we mean that the feature has negligible influence on the final classification performance. To identify the prominent features that separate the positive and negative class, we used Info Gain, ReliefF and minimal-redundancy-maximal-relevance (mRMR) algorithms.

In Info Gain, we calculate the information gain for each feature, and rank them according to this measure, which indicates the gain of information [39]. Different models were built for the top 100, 200, 300, 400 and 500 features. In ReliefF, we choose the features that can be most distinguished between classes. It evaluates the worth of a feature by repeatedly sampling an instance and considering the value of the given feature for the nearest instance of the same and different class [40]. Again, different models were built for the top 100, 200, 300, 400 and 500 features.

The minimal-redundancy-maximal-relevance (mRMR) algorithm is a sequential forward selection algorithm first developed by Peng et al. to analyze the importance of different features [41]. mRMR uses the mutual information to select M features that best fulfill the minimal redundancy and maximal relevance criterion. A detailed description of the mRMR method can be found in (Peng et al., 2005). Different models were built for the top 100, 200, 300, 400 and 500 features.

Performance Evaluation of the SVM

For the purpose of assessing the generalization capability, we calculated the accuracy, sensitivity, specificity and Matthew's Correlation Coefficients (MCC) on an independent test set:

Accuracy = ( T P + T N ) ( T P + F P + T N + F N )
Sensitivity = T P ( T P + F N )
Specificity = T N ( T N + F P )
M C C = T P * T N - F P * F N ( T P + F P ) ( T N + F N ) ( T P + F N ) ( T N + F P )

where TP - True Positive, FP - False Positive, TN - True Negative and FN - False Negative.

The Matthew's correlation coefficient ranges from -1 ≤ MCC ≤ 1. A value of MCC = 1 indicates the best possible prediction while MCC = -1 indicates the worst possible prediction (or anti-correlation). MCC = 0 would be expected for a random prediction scheme.


  1. Wilson T: Comments on the mechanisms of chemi- and bioluminescence. Photochem Photobiol 1995, 62: 601–606. 10.1111/j.1751-1097.1995.tb08706.x

    Article  CAS  Google Scholar 

  2. Hastings JW: Bioluminescence. Academic Press; New York; 1995.

    Google Scholar 

  3. Haddock SHD, Moline MA, Case JF: Bioluminescence in the Sea. Ann Rev Mar Sci 2010, 2: 293–343.

    Article  Google Scholar 

  4. Lloyd JE: Insect Bioluminescence. Academic Press; New York; 1978.

    Google Scholar 

  5. White EH, Rapaport E, Seliger HH, Hopkins TA: The chemi- and bioluminescence of firefly luciferin: an efficient chemical production of electronically excited states. Bioorg Chem 1971, 1: 92–122. 10.1016/0045-2068(71)90009-5

    Article  CAS  Google Scholar 

  6. Wilson T, Hastings JW: Bioluminescence. Annual Review of Cell and Developmental Biology 1998, 14: 197–230. 10.1146/annurev.cellbio.14.1.197

    Article  CAS  PubMed  Google Scholar 

  7. Cormier MJ, Lee J, Wampler JE: Bioluminescence: Recent Advances. Annual Review of Biochemistry 1975, 44: 255–272. 10.1146/

    Article  CAS  PubMed  Google Scholar 

  8. Ward WW, Swiatek GC, Gonzalez DG: Green fluorescent protein in biotechnology education. Methods Enzymol 2000, 305: 672–680.

    Article  CAS  PubMed  Google Scholar 

  9. Chalfie M, Tu Y, Euskirchen G, Ward WW, Prasher DC: Green fluorescent protein as a marker for gene expression. Science 1994, 263: 802–805. 10.1126/science.8303295

    Article  CAS  PubMed  Google Scholar 

  10. Contag CH, Bachmann MH: Advances in in vivo bioluminescence imaging of gene expression. Annu Rev Biomed Eng 2002, 4: 235–260. 10.1146/annurev.bioeng.4.111901.093336

    Article  CAS  PubMed  Google Scholar 

  11. Gonzalez JE, Negulescu PA: Intracellular detection assays for high-throughput screening. Curr Opin Biotechnol 1998, 9: 624–631. 10.1016/S0958-1669(98)80141-9

    Article  CAS  PubMed  Google Scholar 

  12. Kain SR: Green fluorescent protein (GFP): applications in cell-based assays for drug discovery. Drug Discov Today 1999, 4(7):304–312. 10.1016/S1359-6446(99)01330-6

    Article  CAS  PubMed  Google Scholar 

  13. DiPilato LM, Cheng X, Zhang J: Fluorescent indicators of cAMP and Epac activation reveal differential dynamics of cAMP signaling within discrete subcellular compartments. Proc Natl Acad Sci USA 2004, 101: 16513–16518. 10.1073/pnas.0405973101

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  14. Hayes MJ, Merrifield CJ, Shao D, Ayala-Sanmartin J, Schorey CD, Levine TP, Proust J, Curran J, Bailly M, Moss SE : Annexin 2 Binding to Phosphatidylinositol 4, 5-Bisphosphate on Endocytic Vesicles Is Regulated by the Stress Response Pathway. J Biol Chem 2004, 279: 14157–14164. 10.1074/jbc.M313025200

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  15. Sanger F, Nicklen S, Coulson AR: DNA sequencing with chain-terminating inhibitors. Proc Natl Acad Sci USA 1977, 74: 5463–5467. 10.1073/pnas.74.12.5463

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  16. Zhang ZH, Wang ZH, Zhang ZR, Wang YX: A novel method for apoptosis protein subcellular localization prediction combining encoding based on grouped weight and support vector machine. FEBS Lett 2006, 580: 6169–6174. 10.1016/j.febslet.2006.10.017

    Article  CAS  PubMed  Google Scholar 

  17. Zhou XB, Chen C, Li ZC, Zou XY: Using Chou's amphiphilic pseudo- amino acid composition and support vector machine for prediction of enzyme subfamily classes. J Theor Biol 2007, 248: 546–551. 10.1016/j.jtbi.2007.06.001

    Article  CAS  PubMed  Google Scholar 

  18. Brown MP, Grundy WN, Lin D, Cristianini N, Sugnet CW, Furey TS, Ares M Jr, Haussler D: Knowledge-based analysis of microarray gene expression data using SVM. Proceedings of the National Academy of Sciences 97(1):262–267.

  19. Altschul SF, Madden TL, Schaffer AA, Zhang J, Zhang Z, Miller W, Lipman DJ: Gapped BLAST and PSI-BLAST: a new generation of protein database search programs. Nucleic Acids Res 1997, 25(17):3389–3402. 10.1093/nar/25.17.3389

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  20. Eddy SR: Profile hidden Markov models. Bioinformatics 1998, 14(9):755–763. 10.1093/bioinformatics/14.9.755

    Article  CAS  PubMed  Google Scholar 

  21. Sonnhammer EL, Eddy SR, Durbin R: Pfam: a comprehensive database of protein domain families based on seed alignments. Proteins 1997, 28(3):405–420. 10.1002/(SICI)1097-0134(199707)28:3<405::AID-PROT10>3.0.CO;2-L

    Article  CAS  PubMed  Google Scholar 

  22. Hunter S, Apweiler R, Attwood TK, Bairoch A, Bateman A, Binns D, Bork P, Das U, Daugherty L, Duquenne L, Finn RD, Gough J, Haft D, Hulo N, Kahn D, Kelly E, Laugraud A, Letunic I, Lonsdale D, Lopez R, Madera M, Maslen J, McAnulla C, McDowall J, Mistry J, Mitchell A, Mulder N, Natale D, Orengo C, Quinn AF, et al.: InterPro: the integrative protein signature database. Nucleic Acids Res 2009, (37 Database):D224-D228.

    Google Scholar 

  23. Marchler-Bauer A, Lu S, Anderson JB, Chitsaz F, Derbyshire MK, DeWeese-Scott C, Fong JH, Geer LY, Geer RC, Gonzales NR, Gwadz M, Hurwitz DI, Jackson JD, Ke Z, Lanczycki CJ, Lu F, Marchler GH, Mullokandov M, Omelchenko MV, Robertson CL, Song JS, Thanki N, Yamashita RA, Zhang D, Zhang N, Zheng C, Bryant SH: CDD: a Conserved Domain Database for the functional annotation of proteins. Nucleic Acids Res 2011, (39 Database):D225–9.

    Google Scholar 

  24. Kanehisa M, Goto S: KEGG: Kyoto encyclopedia of genes and genomes. Nucleic Acids Res 2000, 28: 27–30. 10.1093/nar/28.1.27

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  25. Quinlan R: C4.5. In Programs for Machine Learning. Morgan Kaufmann Publishers; San Mateo; CA; 1993.

    Google Scholar 

  26. Frank E, Witten IH: Generating Accurate Rule Sets Without Global Optimization. Fifteenth International Conference on Machine Learning 1998, 144–151.

    Google Scholar 

  27. Breiman L: Random Forests. Machine Learning 2001, 45: 5–32. 10.1023/A:1010933404324

    Article  Google Scholar 

  28. Freund Y, Schapire RE: Experiments with a new boosting algorithm. Thirteenth International Conference on Machine Learning, San Francisco 1996, 148–156.

    Google Scholar 

  29. Aha D, Kibler D: Instance-based learning algorithms. Machine Learning 1991, 6: 37–66.

    Google Scholar 

  30. Li W, Jaroszewski L, Odzik GA: Clustering of highly homologous sequences to reduce the size of large protein database. Bioinformatics 2001, 17: 282–283. 10.1093/bioinformatics/17.3.282

    Article  CAS  PubMed  Google Scholar 

  31. Kawashima S, Ogata H, Kanehisa M: AAindex: amino acid index database. Nucleic Acids Res 1999, 27: 368–369. 10.1093/nar/27.1.368

    Article  PubMed Central  CAS  PubMed  Google Scholar 

  32. Pugalenthi G, Kumar KK, Suganthan PN, Gangal R: Identification of catalytic residues from protein structure using support vector machine with sequence and structural features. Biochem Biophys Res Commun 2008, 367: 630–634. 10.1016/j.bbrc.2008.01.038

    Article  CAS  PubMed  Google Scholar 

  33. Cai YD, Pong-Wong R, Feng K, Jen JCH, Chou KC: Application of SVM to predict membrane protein types. Journal of Theoretical Biology 2004, 226: 373–376. 10.1016/j.jtbi.2003.08.015

    Article  CAS  PubMed  Google Scholar 

  34. Cai YD, Liu XJ, Xu XB, Chou KC: Prediction of protein structural classes by support vector machines. Computers & Chemistry 2002, 26: 293–296.

    Article  CAS  Google Scholar 

  35. Vapnik V: Statistical Learning Theory. Wiley-Interscience; New York; 1998.

    Google Scholar 

  36. Muller KR, Mika S, Ratsch K, Tsuda K, Scholkopf B: An introduction to kernel-based learning algorithms. IEEE Trans Neural Networks 2001, 2: 181–201.

    Article  Google Scholar 

  37. Chang CC, Lin CJ: LIBSVM: A Library for Support Vector Machines.2001. []

    Google Scholar 

  38. Joachims T: Optimizing Search Engines Using Clickthrough Data. Proceedings of the ACM Conference on Knowledge Discovery and Data Mining (KDD), ACM 2002.

    Google Scholar 

  39. Haindl M, Somol P, Ververidis D, Kotropoulos C: Feature Selection Based on Mutual Correlation. Progress in Pattern Recognition, Image Anal Appl 2006, 4225: 569–577. 10.1007/11892755_59

    Article  Google Scholar 

  40. Zhang Y, Ding C, Li T: Gene selection algorithm by combining reliefF and mRMR. BMC Genomics 2008, 9: S27. 10.1186/1471-2164-9-S2-S27

    Article  PubMed Central  PubMed  Google Scholar 

  41. Peng HC, Long F, Ding C: Feature selection based on mutual information: criteria of max-dependency, max-relevance, and min-redundancy. IEEE Transactions on Pattern Analysis and Machine Intelligence 2005, 27(8):1226–1238.

    Article  PubMed  Google Scholar 

Download references


KKK and MKH acknowledge the support by the Graduate School for Computing in Medicine and Life Sciences funded by Germany's Excellence Initiative [DFG GSC 235/1]. KKK, MKH, and TM acknowledge Prof. Enno Hartmann and Dr. Steffen Moeller, University of Luebeck, Germany for their support. GP acknowledges Biosciences Core Lab, King Abdullah University of Science & Technology (KAUST), Kingdom of Saudi Arabia for providing infrastructural support.

Author information

Authors and Affiliations


Corresponding author

Correspondence to Krishna Kumar Kandaswamy.

Additional information

Competing interests

The authors declare that they have no competing interests.

Authors' contributions

KKK, GP and MKH contributed equally to the analysis and manuscript preparation. KUK and TM coordinated the study, helped drafting the manuscript, and critically revised its content. All authors read and approved the manuscript.

Authors’ original submitted files for images

Below are the links to the authors’ original submitted files for images.

Authors’ original file for figure 1

Authors’ original file for figure 2

Authors’ original file for figure 5

Rights and permissions

This article is published under license to BioMed Central Ltd. This is an Open Access article distributed under the terms of the Creative Commons Attribution License (, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Reprints and permissions

About this article

Cite this article

Kandaswamy, K.K., Pugalenthi, G., Hazrati, M.K. et al. BLProt: prediction of bioluminescent proteins based on support vector machine and relieff feature selection. BMC Bioinformatics 12, 345 (2011).

Download citation

  • Received:

  • Accepted:

  • Published:

  • DOI: