Questions? Ask them on our slack or anonymously through our form!
Having trouble listening to the podcast above, or want to take it on the go? Try downloading it here.
Show Notes
Join the molpigs team as they have a discussion with one of the theoretical giants of molecular programming: Anne Condon. Over the wide-ranging conversation, she shares her insights on NP-complete problems, solving RNA folding with good data, and how best to teach and mentor students in a manner that creates great researchers and facilitates diversity in the field.
For listeners who would like to skip to the less technical parts of the interview, and hear Anne’s insights on diversity, mentorship and creating a positive experience for students, that section begins 28:33 into the episode.
Biography
Anne Condon is a professor of Computer Science at the University of British Columbia, of which she was formerly head of department, and also a fellow of the Royal Society of Canada. She is known for her extensive work in computational complexity theory and design of algorithms, in the context of bioinformatics, hardware verification, combinatorial auctions, and of course, DNA computing. As well as numerous awards for her work in Computer Science from bodies including the ACM, she has also received many awards for her leadership in advancing women in computing, and has previously held the NSERC/General Motors Canada Chair for Women in Science. She completed her bachelor’s degree at University College Cork, and her doctorate at the University of Washington.