Partitioning sparse matrices with eigenvectors of graphs
SIAM Journal on Matrix Analysis and Applications
Spectral Decomposition of the Laplacian Matrix Applied to RNA Folding Prediction
CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
Hi-index | 0.00 |
In this paper, we investigate the topological properties of synthetic RNAs (i.e., functional RNAs synthesized by in vitro selection technique), by applying the spectral graph partitioning technique. Our analysis shows that the majority of synthetic RNAs possess between two to six vertices and their second eigenvalues lie between one and two. In contrast, natural RNA structures mostly have nine or ten vertices and are less compact with the second eigenvalue below unity. Our statistical analysis (at 95 percentile) also reveals three criteria important for designing novel functional RNAs. Firstly, RNA sequences screened from a large random library, with length of 80 nucleotides and 32.31% paired bases, are very likely to fold into functional RNAs. Secondly, their predicted structures should possess two to six vertices inclusively. Thirdly, to minimize the number of false positives, a combination of filtering parameters should be included, the percentage G/C content of 65.95% and the normalized minimum free energy of -0.021 kcal/mol per nucleotide.