{"id":15047365,"url":"https://github.com/saphereye/rna-folding-simulation","last_synced_at":"2026-01-25T20:06:40.410Z","repository":{"id":238316858,"uuid":"787801621","full_name":"Saphereye/RNA-folding-simulation","owner":"Saphereye","description":"Implementation and visualization of dynamic programming based RNA secondary structure approximation","archived":false,"fork":false,"pushed_at":"2024-06-30T12:04:24.000Z","size":1572,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"main","last_synced_at":"2024-12-29T14:51:30.415Z","etag":null,"topics":["cpp11","dynamic-programming","graphviz-dot","opengl","rna-folding"],"latest_commit_sha":null,"homepage":"https://saphereye.github.io/RNA-folding-simulation/","language":"C++","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Saphereye.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2024-04-17T07:58:43.000Z","updated_at":"2024-06-30T12:04:45.000Z","dependencies_parsed_at":"2024-05-05T16:27:11.156Z","dependency_job_id":"e6b46067-b264-4170-b72a-28f7c2d30a78","html_url":"https://github.com/Saphereye/RNA-folding-simulation","commit_stats":null,"previous_names":["saphereye/rna-folding-cs-f364","saphereye/rna-folding-simulation"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saphereye%2FRNA-folding-simulation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saphereye%2FRNA-folding-simulation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saphereye%2FRNA-folding-simulation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Saphereye%2FRNA-folding-simulation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Saphereye","download_url":"https://codeload.github.com/Saphereye/RNA-folding-simulation/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":239711823,"owners_count":19684679,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":["cpp11","dynamic-programming","graphviz-dot","opengl","rna-folding"],"created_at":"2024-09-24T20:57:11.212Z","updated_at":"2025-12-26T14:30:11.760Z","avatar_url":"https://github.com/Saphereye.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# RNA Folding simulation\n\n## Introduction\n\nThis project finds the theoretical amount of bonds given an RNA sequence.\n\n\u003cdiv style=\"text-align:center;\"\u003e\u003cimg src=\"https://github.com/Saphereye/RNA-Folding-CS-F364/blob/main/assets/demo.png\" alt=\"Demo of the program\" style=\"width:30%;\"\u003e\u003c/div\u003e\n\nThe image demonstrates the visualization of bonds in the RNA using our DP algorithm.\n\n## Brief Description of the Algorithm\n\nThis algorithm is a dynamic programming approach for predicting RNA sequences' secondary structure. It aims to maximize the number of non-crossing base pairs based on the assumption that the more the base pairs, the more stable the RNA molecule is.\n\nThe algorithm uses a 2D matrix to store the number of base pairs for every possible substring of the RNA sequence. The matrix is filled in a bottom-up manner, where each cell (i, j) represents the maximum number of base pairs that can be formed in the substring from index i to j.\n\nThe algorithm considers three possibilities to fill each cell:\n\n1. The number of base pairs if the current base pairs with the base at the end of the substring.\n2. The number of base pairs if the current base does not pair with any base.\n3. The maximum number of base pairs can be formed by bifurcating the substring at any possible position.\n\nThe cell is filled with the maximum of these three possibilities. The final solution is present in the cell (0, n-1), where n is the length of the RNA sequence.\n\nThe algorithm also includes a traceback procedure to recover the optimal structure.\n\n## Comparison against ground truth\n\nWe ran the algorithm on 5 sequences, and these are the results in comparison with ground truth:\n\n| RNA Name                                                         | RNA Length | Our algorithm (# of bonds) | Ground truth (# of bonds) |\n|------------------------------------------------------------------|------------|----------------------------|---------------------------|\n| Homo sapiens (human) RNA, U5D small nuclear 1 (RNU5D-1)          | 100        | 33                         | 23                        |\n| Homo sapiens (human) small nucleolar RNA, C/D box 43 (SNORD43)   | 62         | 19                         | 2                         |\n| Homo sapiens (human) microRNA hsa-mir-921 precursor              | 56         | 17                         | 18                        |\n| Homo sapiens U7 small nuclear RNA                                | 44         | 13                         | 11                        |\n| Homo sapiens (human) small nucleolar RNA, H/ACA box 81 (SNORA81) | 177        | 61                         | 36                        |\n\nHere, we considered the minimum loop length to be 4, i.e. if adding a bond creates a loop of nucleotides, there must be at least 4 nucleotides between the start and end of the bond.\n\n## Timing analysis\n| % time | cumulative seconds | self seconds | calls | self ms/call | total ms/call | name                                                                                                                                                                                       |\n|--------|--------------------|--------------|-------|--------------|---------------|--------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------|\n| 50.00  | 0.02               | 0.02         | 1     | 20.00        | 20.00         | stbi__do_zlib(stbi__zbuf*, char*, int, int, int)                                                                                                                                           |\n| 50.00  | 0.04               | 0.02         | 1     | 20.00        | 20.00         | stbi__create_png_image_raw(stbi__png*, unsigned char*, unsigned int, int, unsigned int, unsigned int, int, int)                                                                            |\n| 0.00   | 0.04               | 0.00         | 1121  | 0.00         | 0.00          | std::__cxx11::basic_string, std::allocator \u003e::_M_replace(unsigned long, unsigned long, char const*, unsigned long)                                                                         |\n| 0.00   | 0.04               | 0.00         | 1035  | 0.00         | 0.00          | std::__cxx11::basic_string, std::allocator \u003e::_M_mutate(unsigned long, unsigned long, char const*, unsigned long)                                                                          |\n| ... | ... | ... | ... | ... | ... | ... |\n\n## Files\n\nHere are the main files in the project:\n\n- [main.cpp](https://saphereye.github.io/RNA-Folding-CS-F364/main_8cpp.html)\n- [rna_folding.cpp](https://saphereye.github.io/RNA-Folding-CS-F364/rna__folding_8hh.html)\n\nThe documentation can be found [here](https://saphereye.github.io/RNA-Folding-CS-F364/).\n\n## Project Group\nThis project was done with the contributions of\n\n| **Name**             | **Id**        |\n|----------------------|---------------|\n| Adarsh Das           | 2021A7PS1511H |\n| Divyateja Pasupuleti | 2021A7PS0075H |\n| Kumarasamy Chelliah  | 2021A7PS0096H |\n| Manan Gupta          | 2021A7PS2091H |\n\nFor the course CS F364 (Design \u0026 Analysis of Algorithms)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaphereye%2Frna-folding-simulation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fsaphereye%2Frna-folding-simulation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fsaphereye%2Frna-folding-simulation/lists"}