1430: Proteins

Explain xkcd: It's 'cause you're dumb.
Revision as of 11:35, 6 October 2014 by Pudder (talk | contribs) (Explanation: - Tried to rearrange into a logical sequence)
Jump to: navigation, search
Ambox notice.png This explanation may be incomplete or incorrect: More info on protein folding, expansion on F@H, explanation of the joke and title text.
If you can address this issue, please edit the page! Thanks.

In this comic, Cueball is asking Megan what she does, to which she replies that she works on software to predict protein folding. This is a reference to one of a number of folding prediction softwares, some of the most well known are Folding@Home, Rosetta@Home and FoldIt.

Protein folding is a mechanism exhibited by protein structures to assume a functional shape. If the folding sequence does not complete, or completes incorrectly, the resulting protein can be inactive or even toxic to the body. These misfolded proteins are responsible for certain allergies, and are believed to be the cause of several neurodegenerative and other diseases.

Cueball asks Megan why is it such a hard computational problem, and Megan replies that it is like folding a live crane, not just a paper crane. That is because a protein cannot fold to an abstract representation of its native fold (analogous to how a paper crane abstractly resembles the live crane) - it must assume an exact, perfect fold in order to be functional.

Levinthal's paradox is a thought experiment, also constituting a self-reference in the theory of protein folding. In 1969, Cyrus Levinthal noted that, because of the very large number of degrees of freedom in an unfolded polypeptide chain, the molecule has an astronomical number of possible conformations. For example, a polypeptide of 100 residues will have 99 peptide bonds, and therefore 198 different phi and psi bond angles. If each of these bond angles can be in one of three stable conformations, the protein may misfold into a maximum of 3198 different conformations (including any possible folding redundancy). Therefore if a protein were to attain its correctly folded configuration by sequentially sampling all the possible conformations, it would require a time longer than the age of the universe to arrive at its correct native conformation. This is true even if conformations are sampled at rapid (nanosecond or picosecond) rates. The "paradox" is that most small proteins fold spontaneously on a millisecond or even microsecond time scale. This paradox is central to computational approaches to protein structure prediction.

Cueball asks whether he can make cuts during the folding process, as if this would then make folding a living crane somehow possible. Megan replies "if you can fold a Protease enzyme", an analogy to saying "if you can fold yourself some scissors". Protease enzymes are proteins whose job it is to break down (i.e. cut) other proteins, often in very specific ways. They are thus analogous to extremely specialized scissors. The meaning of this is that if, when trying to predict the folding trajectory in nature of protein A, one allows to make cuts - one is making the assumption that the Protease that cut protein A is already folded and functional. In other words, making cuts while folding just changes the question to how the protease doing the cutting was folded.

In origami, purists [[1]] considered it as cheating if you cut the paper or use more than one sheet of paper.

To understand the mouseover, you need to know that a protein chain comes with ends distinguished with the names C-terminus and N-terminus (this is a consequence of the way the amino acids link together). Many biologically active proteins have tunnels or cavities within their folded structures that bind to the compounds that they interact with. Proteins are flexible enough and internally connected so you can pull one end and another part of the protein will move.


Folding@Home (F@H) is a distributed computing project which aims to simulate protein folding for research purposes. Rather than the traditional model of using a supercomputer for computation, the project uses idle processing power of a network of personal computers in order to achieve massive computing power. Individuals can join the project by installing the F@H software, and are then able to track their contribution to the project. Individual members may join together as a team, with leaderboards measuring team and individual contributions.

Please be aware that modern computers do not "waste" computing time in the same way as old ones - they dynamically reduce their clock speed and other power consumption at times of low usage. If you donate computer time, you are actually donating money to the cause in the form of your electricty bill (which sounds more convenient than via credit card anyway)