A complexity measurement for de novo protein folding
Predicting how a protein folds based solely on its amino acid sequence is an ongoing challenge for the fields of Bioinformatics and Computer Science. Previous attempts to solve this problem have relied on algorithms and a specific set of benchmark proteins. However, there is currently no method for determining if the set of benchmark proteins share a similar level of complexity with proteins of similar size. As a result, a larger variety of benchmarks might be needed to evade this problem and a measure of complexity established to determine the validity of all benchmarks. We propose here the Ouroboros Complexity Measurement for the de novo folding of proteins. This measurement is easy to compute (not an NP hard problem) and allows the comparing of protein complexity.