- #1
cobalt124
- 61
- 32
I'm looking to understand how protein folding has been shown to be NP-complete, but from the computational side rather than the biological side (if this is possible). Is there an analogous NP-complete problem that is similar? I read that self avoiding random walks might have something to do with it, but I can't visualise how. Maybe a simple introduction/model to/of protein folding would help (if one exists).