{"id":{"repo_id":"njit","oai_identifier":"oai:digitalcommons.njit.edu:theses-1081"},"canonical_url":"https://search.dev.ndltd.org/etd/njit/oai:digitalcommons.njit.edu:theses-1081","repository":{"repo_id":"njit","name":"NJIT","base_url":"https://digitalcommons.njit.edu/do/oai/"},"display":{"title":"Aminormotiffinder - a graph grammar based tool to effectively search a minor motifs in 3D RNA molecules","abstract":"RNA Motifs are three dimensional folds that play important role in RNA folding and its interaction with other molecules. They basically have modular structure and are composed of conserved building blocks dependent upon the sequence. Their automated in silico identification remains a challenging task. Existing motif identification tools does not correctly identify motifs with large structure variations. Here a \"graph rewriting\" based method is proposed to identify motifs in real three dimensional structures. The unique encoding of A Minor Searcher takes into consideration the non canonical base pairs and also multipairing of RNA structural motifs. The accuracy is demonstrated by correctly predicting A minor motifs across many PDB files with zero false positives. There is a huge demand of a good well developed RNA Motif identification algorithm that would successfully identify both canonical / non canonical and isomorphic motifs. In this thesis, a novel encoding algorithm is demonstrated that successfully identifies RNA A Minor Motifs from 3D RNAs. The algorithm encodes the three dimensional RNA Data into one dimension without losing any tertiary information during the transition. A Minor motif is then searched in this one dimensional string using exhaustive search technique with linear time complexity. The efficiency is demonstrated by the comparison of AMinorSearcher with benchmark tool FR3D. FR3D lacked in both precision and recall while AMinorSearcher did not.","abstract_html":"RNA Motifs are three dimensional folds that play important role in RNA folding and its interaction with other molecules. They basically have modular structure and are composed of conserved building blocks dependent upon the sequence. Their automated in silico identification remains a challenging task. Existing motif identification tools does not correctly identify motifs with large structure variations. Here a "graph rewriting" based method is proposed to identify motifs in real three dimensional structures. The unique encoding of A Minor Searcher takes into consideration the non canonical base pairs and also multipairing of RNA structural motifs. The accuracy is demonstrated by correctly predicting A minor motifs across many PDB files with zero false positives. There is a huge demand of a good well developed RNA Motif identification algorithm that would successfully identify both canonical / non canonical and isomorphic motifs. In this thesis, a novel encoding algorithm is demonstrated that successfully identifies RNA A Minor Motifs from 3D RNAs. The algorithm encodes the three dimensional RNA Data into one dimension without losing any tertiary information during the transition. A Minor motif is then searched in this one dimensional string using exhaustive search technique with linear time complexity. The efficiency is demonstrated by the comparison of AMinorSearcher with benchmark tool FR3D. FR3D lacked in both precision and recall while AMinorSearcher did not.","abstract_has_math":false,"creators":["Malhotra, Ankur"],"institution":null,"degree_name":"Master of Science in Bioinformatics - (M.S.)","degree_level":null,"degree_discipline":"Computer Science","degree_department":null,"school":null,"contributors":["Jason T. L. Wang","Michael Allen Baltrush","Guiling Wang"],"advisors":[],"committee_chairs":[],"committee_members":[],"year":2011,"date_issued":"2011-01-31T08:00:00Z","date_published":"2011-01-31T08:00:00Z","updated_at":"2026-07-24T03:22:19Z","subjects":["RNA Motif identification","Bioinformatics","Computer Sciences"],"languages":[],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"https://digitalcommons.njit.edu/theses/82","outbound_label":"Repository record","outbound_source":"dc:identifier"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor","label":"Contributor","values":["Jason T. L. Wang","Michael Allen Baltrush","Guiling Wang"]},{"key":"dc:creator","label":"Author","values":["Malhotra, Ankur"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:type","label":"Dc Type","values":["Thesis"]},{"key":"thesis:degree_discipline","label":"Discipline","values":["Computer Science"]},{"key":"thesis:degree_name","label":"Degree Name","values":["Master of Science in Bioinformatics - (M.S.)"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["RNA Motif identification","Bioinformatics","Computer Sciences"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier","label":"Identifier","values":["https://digitalcommons.njit.edu/theses/82"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description.abstract","label":"Abstract","values":["RNA Motifs are three dimensional folds that play important role in RNA folding and its interaction with other molecules. They basically have modular structure and are composed of conserved building blocks dependent upon the sequence. Their automated in silico identification remains a challenging task. Existing motif identification tools does not correctly identify motifs with large structure variations. Here a \"graph rewriting\" based method is proposed to identify motifs in real three dimensional structures. The unique encoding of A Minor Searcher takes into consideration the non canonical base pairs and also multipairing of RNA structural motifs. The accuracy is demonstrated by correctly predicting A minor motifs across many PDB files with zero false positives. There is a huge demand of a good well developed RNA Motif identification algorithm that would successfully identify both canonical / non canonical and isomorphic motifs. In this thesis, a novel encoding algorithm is demonstrated that successfully identifies RNA A Minor Motifs from 3D RNAs. The algorithm encodes the three dimensional RNA Data into one dimension without losing any tertiary information during the transition. A Minor motif is then searched in this one dimensional string using exhaustive search technique with linear time complexity. The efficiency is demonstrated by the comparison of AMinorSearcher with benchmark tool FR3D. FR3D lacked in both precision and recall while AMinorSearcher did not."]},{"key":"dc:title","label":"Title","values":["Aminormotiffinder - a graph grammar based tool to effectively search a minor motifs in 3D RNA molecules"]}]}],"canonical_facts":{"dc:contributor":["Jason T. L. Wang","Michael Allen Baltrush","Guiling Wang"],"dc:creator":["Malhotra, Ankur"],"dc:description.abstract":["RNA Motifs are three dimensional folds that play important role in RNA folding and its interaction with other molecules. They basically have modular structure and are composed of conserved building blocks dependent upon the sequence. Their automated in silico identification remains a challenging task. Existing motif identification tools does not correctly identify motifs with large structure variations. Here a \"graph rewriting\" based method is proposed to identify motifs in real three dimensional structures. The unique encoding of A Minor Searcher takes into consideration the non canonical base pairs and also multipairing of RNA structural motifs. The accuracy is demonstrated by correctly predicting A minor motifs across many PDB files with zero false positives. There is a huge demand of a good well developed RNA Motif identification algorithm that would successfully identify both canonical / non canonical and isomorphic motifs. In this thesis, a novel encoding algorithm is demonstrated that successfully identifies RNA A Minor Motifs from 3D RNAs. The algorithm encodes the three dimensional RNA Data into one dimension without losing any tertiary information during the transition. A Minor motif is then searched in this one dimensional string using exhaustive search technique with linear time complexity. The efficiency is demonstrated by the comparison of AMinorSearcher with benchmark tool FR3D. FR3D lacked in both precision and recall while AMinorSearcher did not."],"dc:identifier":["https://digitalcommons.njit.edu/theses/82"],"dc:subject":["RNA Motif identification","Bioinformatics","Computer Sciences"],"dc:title":["Aminormotiffinder - a graph grammar based tool to effectively search a minor motifs in 3D RNA molecules"],"dc:type":["Thesis"],"thesis:degree_discipline":["Computer Science"],"thesis:degree_name":["Master of Science in Bioinformatics - (M.S.)"]},"updated_at":"2026-07-24T03:22:19Z"}