Cargando…

Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm

BACKGROUND: Significant efforts have been made to address the problem of identifying short genes in prokaryotic genomes. However, most known methods are not effective in detecting short genes. Because of the limited information contained in short DNA sequences, it is very difficult to accurately dis...

Descripción completa

Detalles Bibliográficos
Autores principales: Chen, Sun, Zhang, Chun-ying, Song, Kai
Formato: Online Artículo Texto
Lenguaje:English
Publicado: BioMed Central 2013
Materias:
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3852556/
https://www.ncbi.nlm.nih.gov/pubmed/24067167
http://dx.doi.org/10.1186/1745-6150-8-23
_version_ 1782478686576967680
author Chen, Sun
Zhang, Chun-ying
Song, Kai
author_facet Chen, Sun
Zhang, Chun-ying
Song, Kai
author_sort Chen, Sun
collection PubMed
description BACKGROUND: Significant efforts have been made to address the problem of identifying short genes in prokaryotic genomes. However, most known methods are not effective in detecting short genes. Because of the limited information contained in short DNA sequences, it is very difficult to accurately distinguish between protein coding and non-coding sequences in prokaryotic genomes. We have developed a new Iteratively Adaptive Sparse Partial Least Squares (IASPLS) algorithm as the classifier to improve the accuracy of the identification process. RESULTS: For testing, we chose the short coding and non-coding sequences from seven prokaryotic organisms. We used seven feature sets (including GC content, Z-curve, etc.) of short genes. In comparison with GeneMarkS, Metagene, Orphelia, and Heuristic Approachs methods, our model achieved the best prediction performance in identification of short prokaryotic genes. Even when we focused on the very short length group ([60–100 nt)), our model provided sensitivity as high as 83.44% and specificity as high as 92.8%. These values are two or three times higher than three of the other methods while Metagene fails to recognize genes in this length range. The experiments also proved that the IASPLS can improve the identification accuracy in comparison with other widely used classifiers, i.e. Logistic, Random Forest (RF) and K nearest neighbors (KNN). The accuracy in using IASPLS was improved 5.90% or more in comparison with the other methods. In addition to the improvements in accuracy, IASPLS required ten times less computer time than using KNN or RF. CONCLUSIONS: It is conclusive that our method is preferable for application as an automated method of short gene classification. Its linearity and easily optimized parameters make it practicable for predicting short genes of newly-sequenced or under-studied species. REVIEWERS: This article was reviewed by Alexey Kondrashov, Rajeev Azad (nominated by Dr J.Peter Gogarten) and Yuriy Fofanov (nominated by Dr Janet Siefert).
format Online
Article
Text
id pubmed-3852556
institution National Center for Biotechnology Information
language English
publishDate 2013
publisher BioMed Central
record_format MEDLINE/PubMed
spelling pubmed-38525562013-12-13 Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm Chen, Sun Zhang, Chun-ying Song, Kai Biol Direct Research BACKGROUND: Significant efforts have been made to address the problem of identifying short genes in prokaryotic genomes. However, most known methods are not effective in detecting short genes. Because of the limited information contained in short DNA sequences, it is very difficult to accurately distinguish between protein coding and non-coding sequences in prokaryotic genomes. We have developed a new Iteratively Adaptive Sparse Partial Least Squares (IASPLS) algorithm as the classifier to improve the accuracy of the identification process. RESULTS: For testing, we chose the short coding and non-coding sequences from seven prokaryotic organisms. We used seven feature sets (including GC content, Z-curve, etc.) of short genes. In comparison with GeneMarkS, Metagene, Orphelia, and Heuristic Approachs methods, our model achieved the best prediction performance in identification of short prokaryotic genes. Even when we focused on the very short length group ([60–100 nt)), our model provided sensitivity as high as 83.44% and specificity as high as 92.8%. These values are two or three times higher than three of the other methods while Metagene fails to recognize genes in this length range. The experiments also proved that the IASPLS can improve the identification accuracy in comparison with other widely used classifiers, i.e. Logistic, Random Forest (RF) and K nearest neighbors (KNN). The accuracy in using IASPLS was improved 5.90% or more in comparison with the other methods. In addition to the improvements in accuracy, IASPLS required ten times less computer time than using KNN or RF. CONCLUSIONS: It is conclusive that our method is preferable for application as an automated method of short gene classification. Its linearity and easily optimized parameters make it practicable for predicting short genes of newly-sequenced or under-studied species. REVIEWERS: This article was reviewed by Alexey Kondrashov, Rajeev Azad (nominated by Dr J.Peter Gogarten) and Yuriy Fofanov (nominated by Dr Janet Siefert). BioMed Central 2013-09-25 /pmc/articles/PMC3852556/ /pubmed/24067167 http://dx.doi.org/10.1186/1745-6150-8-23 Text en Copyright © 2013 Chen et al.; licensee BioMed Central Ltd. http://creativecommons.org/licenses/by/2.0 This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/2.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
spellingShingle Research
Chen, Sun
Zhang, Chun-ying
Song, Kai
Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title_full Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title_fullStr Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title_full_unstemmed Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title_short Recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
title_sort recognizing short coding sequences of prokaryotic genome using a novel iteratively adaptive sparse partial least squares algorithm
topic Research
url https://www.ncbi.nlm.nih.gov/pmc/articles/PMC3852556/
https://www.ncbi.nlm.nih.gov/pubmed/24067167
http://dx.doi.org/10.1186/1745-6150-8-23
work_keys_str_mv AT chensun recognizingshortcodingsequencesofprokaryoticgenomeusinganoveliterativelyadaptivesparsepartialleastsquaresalgorithm
AT zhangchunying recognizingshortcodingsequencesofprokaryoticgenomeusinganoveliterativelyadaptivesparsepartialleastsquaresalgorithm
AT songkai recognizingshortcodingsequencesofprokaryoticgenomeusinganoveliterativelyadaptivesparsepartialleastsquaresalgorithm