You will write small functions that treat a peptide as a string of one-letter codes. They count the peptide bonds, find the molar mass, test for the biuret colour and count the different sequences that a set of residues can make.
The idea. A chain of residues has peptide bonds, and each bond releases one molecule of water. The biuret test needs at least two peptide bonds. Repeated residues make some orders the same.
Your tasks.
bonds(seq).peptide_mass(seq). Use the mass table and subtract one water for each bond.biuret(seq) so that it returns True when the peptide has at least two peptide bonds.orders(seq) so that it returns the number of different sequences that can be made from the letters of seq.Have you tried it?
Do the tasks in the editor first, and run the checker after each one. Its hints help when a check fails. When you are ready, compare your code with this solution.
Log in to join the discussion.
Loading…