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.