RNA Search with Decision Trees and Partial Covariance Models
This document was originally published by IEEE/ACM Transactions on Computational Biology and Bioinformatics. Copyright restrictions may apply.
The use of partial covariance models to search for RNA family members in genomic sequence databases is explored. The partial models are formed from contiguous subranges of the overall RNA family multiple alignment columns. A binary decision-tree framework is presented for choosing the order to apply the partial models and the score thresholds on which to make the decisions. The decision trees are chosen to minimize computation time subject to the constraint that all of the training sequences are passed to the full covariance model for final evaluation. Computational intelligence methods are suggested to select the decision tree since the tree can be quite complex and there is no obvious method to build the tree in these cases. Experimental results from seven RNA families shows execution times of 0.066-0.268 relative to using the full covariance model alone. Tests on the full sets of known sequences for each family show that at least 95 percent of these sequences are found for two families and 100 percent for five others. Since the full covariance model is run on all sequences accepted by the partial model decision tree, the false alarm rate is at least as low as that of the full model alone.
Jennifer A. Smith. "RNA Search with Decision Trees and Partial Covariance Models" IEEE/ACM Transactions on Computational Biology and Bioinformatics (2009).
Available at: http://works.bepress.com/jennifer_smith/10