Book contents
- Frontmatter
- Introduction
- Dedication
- Contents
- I Classroom-tested Projects
- The Game of “Take Away”
- Pile Splitting Problem: Introducing Strong Induction
- Generalizing Pascal: The Euler Triangles
- Coloring and Counting Rectangles on the Board
- Fun and Games with Squares and Planes
- Exploring Recursion with the Josephus Problem: (Or how to play “One Potato, Two Potato” for keeps)
- Using Trains to Model Recurrence Relations
- Codon Classes
- How to change coins, M&M's, or chicken nuggets: The linear Diophantine problem of Frobenius
- Calculator Activities for a Discrete Mathematics Course
- Bulgarian solitaire
- Can you make the geodesic dome?
- Exploring Polyhedra and Discovering Euler's Formula
- Further Explorations with the Towers of Hanoi
- The Two Color Theorem
- Counting Perfect Matchings and Benzenoids
- Exploring Data Compression via Binary Trees
- A Problem in Typography
- Graph Complexity
- II Historical Projects in Discrete Mathematics and Computer Science
- III Articles Extending Discrete Mathematics Content
- IV Articles on Discrete Mathematics Pedagogy
- About the Editor
Codon Classes
from I - Classroom-tested Projects
- Frontmatter
- Introduction
- Dedication
- Contents
- I Classroom-tested Projects
- The Game of “Take Away”
- Pile Splitting Problem: Introducing Strong Induction
- Generalizing Pascal: The Euler Triangles
- Coloring and Counting Rectangles on the Board
- Fun and Games with Squares and Planes
- Exploring Recursion with the Josephus Problem: (Or how to play “One Potato, Two Potato” for keeps)
- Using Trains to Model Recurrence Relations
- Codon Classes
- How to change coins, M&M's, or chicken nuggets: The linear Diophantine problem of Frobenius
- Calculator Activities for a Discrete Mathematics Course
- Bulgarian solitaire
- Can you make the geodesic dome?
- Exploring Polyhedra and Discovering Euler's Formula
- Further Explorations with the Towers of Hanoi
- The Two Color Theorem
- Counting Perfect Matchings and Benzenoids
- Exploring Data Compression via Binary Trees
- A Problem in Typography
- Graph Complexity
- II Historical Projects in Discrete Mathematics and Computer Science
- III Articles Extending Discrete Mathematics Content
- IV Articles on Discrete Mathematics Pedagogy
- About the Editor
Summary
Summary
This project explores an application of equivalence relations to bioinformatics. RNA can be considered as a string over a four-letter alphabet. Cells use triples of these bases to regulate the production of protein by signaling the sequence of amino acids. But there are far fewer than 64 amino acids; is there a system behind the redundancy?
Students examine the equivalence classes arising from six difference equivalence relations on the set of codons, from simple to somewhat intricate. Then they research the actual genetic code; it is “closest” to one of the simpler relations, although it is far from an exact match.
Notes for the instructor
This project was motivated by student interest in bioinformatics and my difficulty finding engaging applications of equivalence relations and classes. The set of 64 codons is small enough to be tractable, but large enough to encourage labor-saving devices. While some of the relations have no biological motivation (e.g., number of A's), they do encourage the use of standard counting techniques. Students are instructed to “describe the equivalence classes” for each relation; this can prompt discussions of a good order for listing set elements and the proper use of ellipses.
I typically put the students in randomgroups of three (or two) for a project and give thema class period to get started, with the expectation that they will need to work outside class to complete the project and write it up.
- Type
- Chapter
- Information
- Resources for Teaching Discrete MathematicsClassroom Projects, History Modules, and Articles, pp. 61 - 64Publisher: Mathematical Association of AmericaPrint publication year: 2009