{"title":"Depth Annotation of RNA Folds for Secondary Structure Motif Search","authors":"D. Ashlock, J. Schonfeld","doi":"10.1109/CIBCB.2005.1594896","DOIUrl":null,"url":null,"abstract":"The biological activity of RNA depends on the way it folds into secondary structures. Presented here is a framework for exploratory motif searching in the space of RNA secondary structures. A collection of RNA sequences, suspected of having a particular biological activity, is fragmented into overlapping pieces of a uniform size. Each piece is folded and the details of the fold are used to annotate the primary structure. Distances between annotated structures are computed. The distance matrix for the structures is then projected into the Euclidean plane for visualization and detection of clusters. A motif is taken to be a cluster in the two dimensional space. An instance of the framework is implemented for testing on a data set containing examples of the Iron Response Element in the following manner. Folding is performed with the Mfold package. A depth-of-fold that records stems and loops onto the primary sequence is used to annotate the pieces of RNA. Dynamic programming is used to find distances between pieces of annotated primary sequence. An evolutionary algorithm is then used to find a one-to-one mapping of pieces of RNA to points in the plane that has acceptable distortion of the distances found with dynamic programming. This one-to-one mapping is a form of non-linear projection that optimizes for fidelity of projected distances to the distances derived from the Iron Response Element data set.","PeriodicalId":330810,"journal":{"name":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","volume":"46 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"11","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2005 IEEE Symposium on Computational Intelligence in Bioinformatics and Computational Biology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CIBCB.2005.1594896","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 11
Abstract
The biological activity of RNA depends on the way it folds into secondary structures. Presented here is a framework for exploratory motif searching in the space of RNA secondary structures. A collection of RNA sequences, suspected of having a particular biological activity, is fragmented into overlapping pieces of a uniform size. Each piece is folded and the details of the fold are used to annotate the primary structure. Distances between annotated structures are computed. The distance matrix for the structures is then projected into the Euclidean plane for visualization and detection of clusters. A motif is taken to be a cluster in the two dimensional space. An instance of the framework is implemented for testing on a data set containing examples of the Iron Response Element in the following manner. Folding is performed with the Mfold package. A depth-of-fold that records stems and loops onto the primary sequence is used to annotate the pieces of RNA. Dynamic programming is used to find distances between pieces of annotated primary sequence. An evolutionary algorithm is then used to find a one-to-one mapping of pieces of RNA to points in the plane that has acceptable distortion of the distances found with dynamic programming. This one-to-one mapping is a form of non-linear projection that optimizes for fidelity of projected distances to the distances derived from the Iron Response Element data set.