View Proposal #346
If this proposal belongs to you, you are authorized to update it. Use the menu on the right.
| ID | 346 |
|---|---|
| First Name | Ivars |
| Last Name | Peterson |
| Institution | MAA |
| Speaker Category | invited |
| Title of Talk | Pancake Sorting, Prefix Reversals, and DNA Rearrangements |
| Abstract | The seemingly simple problem of sorting a stack of differently sized pancakes has become a staple of theoretical computer science and led to insights into the evolution of species. First proposed in The American Mathematical Monthly, the problem attracted the attention of noted mathematicians and computer scientists. It now plays an important role in the realm of molecular biology for making sense of DNA rearrangements. |
| Subject area(s) | Mathematical Counting |
| Suitable for undergraduates? | Yes |
| Day Preference | SaturdayStrong |
| Computer Needed? | Y |
| Bringing a laptop? | N |
| Overhead Needed? | Y |
| Software requests | |
| Special Needs | |
| Date Submitted | 9/19/12 |
| Year | 2012 |