Skip Navigation



Bioinformatics Advance Access published online on January 31, 2007

Bioinformatics, doi:10.1093/bioinformatics/btm026
This Article
Right arrow Advance Access manuscript (PDF) Freely available
Right arrow All Versions of this Article:
23/11/1321    most recent
btm026v1
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in PubMed
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Kwang Loong, S. N.
Right arrow Articles by Mishra, S. K.
Right arrow Search for Related Content
PubMed
Right arrow PubMed Citation
Right arrow Articles by Kwang Loong, S. N.
Right arrow Articles by Mishra, S. K.
Social Bookmarking
 Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

© The Author (2007). Published by Oxford University Press. All rights reserved. For Permissions, please email: journals.permissions@oxfordjournals.org

De Novo SVM Classification of Precursor MicroRNAs from Genomic Pseudo Hairpins Using Global and Intrinsic Folding Measures

Stanley NG Kwang Loong {dagger},{ddagger},* and Santosh K. Mishra {dagger},{ddagger}

{dagger} Bioinformatics Institute, 30 Biopolis Street, #07-01, Matrix, Singapore 138671
{ddagger} NUS Graduate School for Integrative Sciences & Engineering, Centre for Life Sciences, #05-01, 28 Medical Drive, Singapore 117456

*To whom correspondence should be addressed. Stanley NG Kwang Loong, E-mail: stanley{at}bii.a-star.edu.sg


   Abstract

Motivation: MicroRNAs (miRNAs) are small ncRNAs participating in diverse cellular and physiological processes through the post-transcriptional gene regulatory pathway. Critically associated with the miRNAs biogenesis, the hairpin structure is a necessary feature for the computational classification of novel precursor miRNAs (pre-miRs). Though many of the abundant genomic inverted repeats (pseudo hairpins) can be filtered computationally, novel specie-specific pre-miRs are likely to remain elusive.

Results: miPred is a de novo Support Vector Machine (SVM) classifier for identifying pre-miRs without relying on phylogenetic conservation. To achieve significantly higher sensitivity and specificity than existing (quasi) de novo predictors, it employs a Gaussian Radial Basis Function kernel (RBF) as a similarity measure for 29 global and intrinsic hairpin folding attributes. They characterize a pre-miR at the dinucleotide sequence, hairpin folding, non-linear statistical thermodynamics, and topological levels. Trained on 200 human pre-miRs and 400 pseudo hairpins, miPred achieves 93.50% (five-fold cross-validation accuracy) and 0.9833 (area under the ROC). Tested on the remaining 123 human pre-miRs and 246 pseudo hairpins, it reports 84.55% (sensitivity), 97.97% (specificity), and 93.50% (accuracy). Validated onto 1,918 pre-miRs across 40 non-human species and 3,836 pseudo hairpins, it yields 87.65% (92.08%), 97.75% (97.42%), and 94.38% (95.64%) for the mean (overall) sensitivity, specificity, and accuracy. Notably, A. mellifera, A. Geoffroyi, C. familiaris, E. Barr, H. Simplex virus, H. cytomegalovirus, O. aries, P. patens, R. lymphocryptovirus, Simian virus, and Z. mays are unambiguously classified with 100.00% (sensitivity) and >93.75% (specificity).

Availability: Datasets, raw statistical results, and source codes are available at http://web.bii.a-star.edu.sg/~stanley/Publications

Supplementary information: Supplementary data are available at Bioinformatics online.

Associate Editor: Charlie Hodgman


Received on July 1, 2006; revised on December 13, 2006; accepted on January 23, 2007

Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?


This article has been cited by other articles:


Home page
BioinformaticsHome page
Y. Xu, X. Zhou, and W. Zhang
MicroRNA prediction with a novel ranking algorithm based on random walks
Bioinformatics, July 1, 2008; 24(13): i50 - i58.
[Abstract] [PDF]



Disclaimer:
Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.