Cargando…

Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations

Predicting protein functional classes such as localization sites and modifications plays a crucial role in function annotation. Given a tremendous amount of sequence data yielded from high-throughput sequencing experiments, the need of efficient and interpretable prediction strategies has been rapid...

Descripción completa

Detalles Bibliográficos
Autores principales: Chang, Jia-Ming, Taly, Jean-Francois, Erb, Ionas, Sung, Ting-Yi, Hsu, Wen-Lian, Tang, Chuan Yi, Notredame, Cedric, Su, Emily Chia-Yu
Formato: Online Artículo Texto
Lenguaje:English
Publicado: Public Library of Science 2013
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3795737/
https://www.ncbi.nlm.nih.gov/pubmed/24146760
http://dx.doi.org/10.1371/journal.pone.0075542
_version_ 1782287424945127424
author Chang, Jia-Ming
Taly, Jean-Francois
Erb, Ionas
Sung, Ting-Yi
Hsu, Wen-Lian
Tang, Chuan Yi
Notredame, Cedric
Su, Emily Chia-Yu
author_facet Chang, Jia-Ming
Taly, Jean-Francois
Erb, Ionas
Sung, Ting-Yi
Hsu, Wen-Lian
Tang, Chuan Yi
Notredame, Cedric
Su, Emily Chia-Yu
author_sort Chang, Jia-Ming
collection PubMed
description Predicting protein functional classes such as localization sites and modifications plays a crucial role in function annotation. Given a tremendous amount of sequence data yielded from high-throughput sequencing experiments, the need of efficient and interpretable prediction strategies has been rapidly amplified. Our previous approach for subcellular localization prediction, PSLDoc, archives high overall accuracy for Gram-negative bacteria. However, PSLDoc is computational intensive due to incorporation of homology extension in feature extraction and probabilistic latent semantic analysis in feature reduction. Besides, prediction results generated by support vector machines are accurate but generally difficult to interpret. In this work, we incorporate three new techniques to improve efficiency and interpretability. First, homology extension is performed against a compact non-redundant database using a fast search model to reduce running time. Second, correspondence analysis (CA) is incorporated as an efficient feature reduction to generate a clear visual separation of different protein classes. Finally, functional classes are predicted by a combination of accurate compact set (CS) relation and interpretable one-nearest neighbor (1-NN) algorithm. Besides localization data sets, we also apply a human protein kinase set to validate generality of our proposed method. Experiment results demonstrate that our method make accurate prediction in a more efficient and interpretable manner. First, homology extension using a fast search on a compact database can greatly accelerate traditional running time up to twenty-five times faster without sacrificing prediction performance. This suggests that computational costs of many other predictors that also incorporate homology information can be largely reduced. In addition, CA can not only efficiently identify discriminative features but also provide a clear visualization of different functional classes. Moreover, predictions based on CS achieve 100% precision. When combined with 1-NN on unpredicted targets by CS, our method attains slightly better or comparable performance compared with the state-of-the-art systems.
format Online
Article
Text
id pubmed-3795737
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher Public Library of Science
record_format MEDLINE/PubMed
spelling pubmed-37957372013-10-21 Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations Chang, Jia-Ming Taly, Jean-Francois Erb, Ionas Sung, Ting-Yi Hsu, Wen-Lian Tang, Chuan Yi Notredame, Cedric Su, Emily Chia-Yu PLoS One Research Article Predicting protein functional classes such as localization sites and modifications plays a crucial role in function annotation. Given a tremendous amount of sequence data yielded from high-throughput sequencing experiments, the need of efficient and interpretable prediction strategies has been rapidly amplified. Our previous approach for subcellular localization prediction, PSLDoc, archives high overall accuracy for Gram-negative bacteria. However, PSLDoc is computational intensive due to incorporation of homology extension in feature extraction and probabilistic latent semantic analysis in feature reduction. Besides, prediction results generated by support vector machines are accurate but generally difficult to interpret. In this work, we incorporate three new techniques to improve efficiency and interpretability. First, homology extension is performed against a compact non-redundant database using a fast search model to reduce running time. Second, correspondence analysis (CA) is incorporated as an efficient feature reduction to generate a clear visual separation of different protein classes. Finally, functional classes are predicted by a combination of accurate compact set (CS) relation and interpretable one-nearest neighbor (1-NN) algorithm. Besides localization data sets, we also apply a human protein kinase set to validate generality of our proposed method. Experiment results demonstrate that our method make accurate prediction in a more efficient and interpretable manner. First, homology extension using a fast search on a compact database can greatly accelerate traditional running time up to twenty-five times faster without sacrificing prediction performance. This suggests that computational costs of many other predictors that also incorporate homology information can be largely reduced. In addition, CA can not only efficiently identify discriminative features but also provide a clear visualization of different functional classes. Moreover, predictions based on CS achieve 100% precision. When combined with 1-NN on unpredicted targets by CS, our method attains slightly better or comparable performance compared with the state-of-the-art systems. Public Library of Science 2013-10-11 /pmc/articles/PMC3795737/ /pubmed/24146760 http://dx.doi.org/10.1371/journal.pone.0075542 Text en © 2013 Chang et al http://creativecommons.org/licenses/by/4.0/ 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 author and source are properly credited.
spellingShingle Research Article
Chang, Jia-Ming
Taly, Jean-Francois
Erb, Ionas
Sung, Ting-Yi
Hsu, Wen-Lian
Tang, Chuan Yi
Notredame, Cedric
Su, Emily Chia-Yu
Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title_full Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title_fullStr Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title_full_unstemmed Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title_short Efficient and Interpretable Prediction of Protein Functional Classes by Correspondence Analysis and Compact Set Relations
title_sort efficient and interpretable prediction of protein functional classes by correspondence analysis and compact set relations
topic Research Article
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3795737/
https://www.ncbi.nlm.nih.gov/pubmed/24146760
http://dx.doi.org/10.1371/journal.pone.0075542
work_keys_str_mv AT changjiaming efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT talyjeanfrancois efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT erbionas efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT sungtingyi efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT hsuwenlian efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT tangchuanyi efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT notredamecedric efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations
AT suemilychiayu efficientandinterpretablepredictionofproteinfunctionalclassesbycorrespondenceanalysisandcompactsetrelations