Lucy Ham
I joined the Theoretical Systems Biology Group at the University of Melbourne as a postdoctoral researcher in November 2018. My research interests are in the development of mathematical and statistical approaches for the analysis of biological processes. A particular focus of my recent work has been on developing stochastic models for understanding gene regulation.
I completed a Bachelor of Science at La Trobe University, graduating with Honours (1st) in mathematics and statistics in 2013. Following this, I received a Ph.D. in pure mathematics in 2017, under the supervision of Professor Brian Davey and Associate Professor Tomasz Kowalski. My Ph.D. research was in the mathematics underlying the theory of computing, with a focus on universal algebraic approaches to classifying the computational complexity of constraint problems.
Publications
Extrinsic Noise and Heavy-Tailed Laws in Gene Expression ➟
L. Ham*, R.D. Brackston*, Michael P.H. Stumpf (2019). bioRxiv.
Extrinsic Noise and Heterogeneity in Transcription
R.D. Brackston, L. Ham, M.P.H. Stumpf (in progress since 2019).
Hardness for Universal Horn Classes and Other Implied Constraint Problems
L. Barto, L. Ham, and M. Jackson (in progress, 2018). arXiv.
Axiomatisability, Preservation and Hardness for Hypergraph Quasivarieties ➟
L. Ham and M. Jackson (2018). Algebra Universalis 78, 17pp.
All or Nothing: Toward a Promise Problem Dichotomy for Constraint Problems ➟
L. Ham and M. Jackson (2017). Principles and Practice of Constraint Programming (CP 2017), Lecture Notes in Computer Science 10416, 139–156.
Gap Theorems for Robust Satisfiability: Boolean CSPs and Beyond ➟
L. Ham (2017). Theoretical Computer Science 676, 69–91.
Relativised Homomorphism Preservation at the Finite Level➟
L. Ham (2017). Studia Logica 105, 761–786.
A Gap Trichotomy for Boolean Constraint Problems: Extending Schaefer’s Theorem ➟
L. Ham (2016). 27th International Symposium on Algorithms and Computation (ISAAC 2016), 36:1–36:12.