Abstract

Background: Root is a desirable trait for modern plant breeding programs, as the roots play a pivotal role in the growth and development of plants. Therefore, identification of the genes governing the root traits is an essential research component. With regard to the identification of root-associated genes/proteins, the existing wet-lab experiments are resource intensive and the gene expression studies are species-specific. Thus, we proposed a supervised learning-based computational method for the identification of root-associated proteins. Method: The problem was formulated as a binary classification, where the root-associated proteins and non-root-associated proteins constituted the two classes. Four different machine learning algorithms such as support vector machine (SVM), extreme gradient boosting, random forest, and adaptive boosting were employed for the classification of proteins of the two classes. Sequence-derived features such as AAC, DPC, CTD, PAAC, and ACF were used as input for the learning algorithms. Results: The SVM achieved higher accuracy with the 250 selected features of AAC+DPC+CTD than that of other possible combinations of feature sets and learning algorithms. Specifically, SVM with the selected features achieved overall accuracies of 0.74, 0.73, and 0.73 when evaluated with single 5-fold cross-validation (5F-CV), repeated 5F-CV, and independent test set, respectively. Conclusions: A web-enabled prediction tool SVM-Root (https://iasri-sg.icar.gov.in/svmroot/) has been developed for the computational prediction of the root-associated proteins. Being the first of its kind, the proposed model is believed to supplement the existing experimental methods and high throughput GWAS and transcriptome studies.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.