{"id":{"repo_id":"utahstate","oai_identifier":"oai:digitalcommons.usu.edu:etd-1353"},"canonical_url":"https://search.ndltd.org/etd/utahstate/oai:digitalcommons.usu.edu:etd-1353","repository":{"repo_id":"utahstate","name":"Utah State University","base_url":"https://digitalcommons.usu.edu/do/oai/"},"display":{"title":"Predicting RNA Secondary Structures By Folding Simulation: Software and Experiments","abstract":"We present a new method for predicting the secondary structure of RNA sequences. Using our method, each RNA nucleotide of an RNA Sequence is represented as a point on a 3D triangular lattice. Using the Simulated Annealing technique, we manipulate the location of the points on the lattice. We explore various scoring functions for judging the relative quality of the structures created by these manipulations. After near optimal conﬁgurations on the lattice have been found, we describe how the lattice locations of the nucleotides can be used to predict a secondary structure for the sequence. This prediction can be further improved by using a greedy, 2-interval post-processing step to ﬁnd the maximum independent set of the helices predicted by the lattice. The complete method, DeltaIS, is then compared with HotKnot, a popular secondary structure prediction program. We evaluate the relative eﬀectiveness of DeltaIS and HotKnot by predicting 252 sequences from the Pseudobase Database. The predictions of each method are then scored against the true structures. We show DeltaIS to be superior to HotKnot for shorter RNA sequences, and in the number of perfectly predicted structures.","abstract_html":"We present a new method for predicting the secondary structure of RNA sequences. Using our method, each RNA nucleotide of an RNA Sequence is represented as a point on a 3D triangular lattice. Using the Simulated Annealing technique, we manipulate the location of the points on the lattice. We explore various scoring functions for judging the relative quality of the structures created by these manipulations. After near optimal conﬁgurations on the lattice have been found, we describe how the lattice locations of the nucleotides can be used to predict a secondary structure for the sequence. This prediction can be further improved by using a greedy, 2-interval post-processing step to ﬁnd the maximum independent set of the helices predicted by the lattice. The complete method, DeltaIS, is then compared with HotKnot, a popular secondary structure prediction program. We evaluate the relative eﬀectiveness of DeltaIS and HotKnot by predicting 252 sequences from the Pseudobase Database. The predictions of each method are then scored against the true structures. We show DeltaIS to be superior to HotKnot for shorter RNA sequences, and in the number of perfectly predicted structures.","abstract_has_math":false,"creators":["Gillespie, Joel Omni"],"institution":"Hosted by Utah State University Libraries","degree_name":"Master of Science (MS)","degree_level":"Thesis","degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Minghui Jiang","Nicholas Flann","Stephen Allan"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":null,"date_issued":"","date_published":null,"updated_at":"2026-11-19T08:46:09Z","subjects":["Annealing","Folding","RNA","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/9ce9-58c6"],"render_values":[{"text":"https://doi.org/10.26076/9ce9-58c6","href":"https://doi.org/10.26076/9ce9-58c6","code":true}]}],"person_identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.usu.edu/etd/359","outbound_label":"Repository record","outbound_source":"dc:identifier","record_url":"https://digitalcommons.usu.edu/etd/359","record_label":"Repository record","record_kind":"record","record_source":"dc:identifier","download_url":null,"download_label":null,"download_source":null,"access_status":null,"embargo_until":null,"access_note":null},"source_record":{"url":"https://digitalcommons.usu.edu/do/oai/?verb=GetRecord&metadataPrefix=oai_etdms&identifier=oai%3Adigitalcommons.usu.edu%3Aetd-1353","prefix":"oai_etdms"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Minghui Jiang","Nicholas Flann","Stephen Allan"]},{"key":"dc:creator","label":"Author","values":["Gillespie, Joel Omni"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date.available","label":"Dc Date Available","values":["2009-05-31T07:00:00Z"]},{"key":"dc:date.created","label":"Dc Date Created","values":["2009-05-01T07:00:00Z"]},{"key":"dc:publisher","label":"Institution","values":["Hosted by Utah State University Libraries"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_level","label":"Degree Level","values":["Thesis"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science (MS)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Annealing","Folding","RNA","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.usu.edu/etd/359"]},{"key":"dc:identifier.doi","label":"DOI","values":["https://doi.org/10.26076/9ce9-58c6"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["We present a new method for predicting the secondary structure of RNA sequences. Using our method, each RNA nucleotide of an RNA Sequence is represented as a point on a 3D triangular lattice. Using the Simulated Annealing technique, we manipulate the location of the points on the lattice. We explore various scoring functions for judging the relative quality of the structures created by these manipulations. After near optimal conﬁgurations on the lattice have been found, we describe how the lattice locations of the nucleotides can be used to predict a secondary structure for the sequence. This prediction can be further improved by using a greedy, 2-interval post-processing step to ﬁnd the maximum independent set of the helices predicted by the lattice. The complete method, DeltaIS, is then compared with HotKnot, a popular secondary structure prediction program. We evaluate the relative eﬀectiveness of DeltaIS and HotKnot by predicting 252 sequences from the Pseudobase Database. The predictions of each method are then scored against the true structures. We show DeltaIS to be superior to HotKnot for shorter RNA sequences, and in the number of perfectly predicted structures."]},{"key":"dc:title","label":"Title","values":["Predicting RNA Secondary Structures By Folding Simulation: Software and Experiments"]}]}],"canonical_facts":{"dc:contributor":["Minghui Jiang","Nicholas Flann","Stephen Allan"],"dc:creator":["Gillespie, Joel Omni"],"dc:date.available":["2009-05-31T07:00:00Z"],"dc:date.created":["2009-05-01T07:00:00Z"],"dc:description.abstract":["We present a new method for predicting the secondary structure of RNA sequences. Using our method, each RNA nucleotide of an RNA Sequence is represented as a point on a 3D triangular lattice. Using the Simulated Annealing technique, we manipulate the location of the points on the lattice. We explore various scoring functions for judging the relative quality of the structures created by these manipulations. After near optimal conﬁgurations on the lattice have been found, we describe how the lattice locations of the nucleotides can be used to predict a secondary structure for the sequence. This prediction can be further improved by using a greedy, 2-interval post-processing step to ﬁnd the maximum independent set of the helices predicted by the lattice. The complete method, DeltaIS, is then compared with HotKnot, a popular secondary structure prediction program. We evaluate the relative eﬀectiveness of DeltaIS and HotKnot by predicting 252 sequences from the Pseudobase Database. The predictions of each method are then scored against the true structures. We show DeltaIS to be superior to HotKnot for shorter RNA sequences, and in the number of perfectly predicted structures."],"dc:identifier":["https://digitalcommons.usu.edu/etd/359"],"dc:identifier.doi":["https://doi.org/10.26076/9ce9-58c6"],"dc:publisher":["Hosted by Utah State University Libraries"],"dc:subject":["Annealing","Folding","RNA","Computer Sciences"],"dc:title":["Predicting RNA Secondary Structures By Folding Simulation: Software and Experiments"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_level":["Thesis"],"thesis:degree_name":["Master of Science (MS)"]},"updated_at":"2026-11-19T08:46:09Z"}