Submission information
Submission Number: 108
Submission ID: 200
Submission UUID: 9d5f4163-d512-40b0-9eda-8c7fd954b914
Submission URI: /form/project
Created: Mon, 09/06/2021 - 09:17
Completed: Mon, 09/06/2021 - 09:27
Changed: Wed, 07/06/2022 - 15:09
Remote IP address: 148.74.85.131
Submitted by: Avery Leider
Language: English
Is draft: No
Webform: Project
Investigating Protein Folding using Knapsack Minimization Algorithms on High Performance Computers and Quantum Computers

Halted
Project Leader
Project Personnel
Project Information
Investigating Protein Folding using Knapsack Minimization Algorithms on High Performance Computers and Quantum Computers. Protein folding and unfolding in nature appears to use the forward thinking greedy algorithm of Knapsack Minimization. Understanding this and then enhancing it with sorting can help us find new medicines swiftly, instead of the incremental approach that is currently the method for the pharmaceutical sciences, such as bioinformatics and biotechnology. We seek to understand how to use our current bioinformatics tools on the AiMOS high performance computer (HPC) and the Q-Experience quantum computers of IBM available to researchers.
Project Information Subsection
Write code in Python and post it in Google Colab to share and collaborate. Use greedy algorithm template for code. Check on
{Empty}
Seeking biological informatics and quantum computing curious.
{Empty}
Can work with any level
{Empty}
Pace University
861 Bedford Rd
Pleasantville, New York. 10570
Pleasantville, New York. 10570
CR-Rensselaer Polytechnic Institute
{Empty}
Yes
Already behind3Start date is flexible
6 months
{Empty}
09/08/2021
{Empty}
02/09/2022
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
Final Report
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}
{Empty}