An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats. - Atheer A. Matroud; Michael D. Hendy; Christopher P. Tuffley (RECOMB-CG, 2010)

An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats in Biological Sequences. - Atheer A. Matroud; Christopher P. Tuffley; Michael D. Hendy (J. Comput. Biol., 2011)

A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. - Atheer A. Matroud; Christopher P. Tuffley; David Bryant; Michael D. Hendy (BSB, 2012)

Counting the spanning trees of the 3-cube using edge slides. - Christopher P. Tuffley (Australas. J Comb., 2012)

Maximising common fixtures in a round robin tournament with two divisions. - Wayne Burrows; Christopher P. Tuffley (Australas. J Comb., 2015)

Subsumed Homoclinic Connections and Infinitely Many Coexisting Attractors in Piecewise-Linear Maps. - David J. W. Simpson; Christopher P. Tuffley (Int. J. Bifurc. Chaos, 2017)

Characterisation and classification of signatures of spanning trees of the n-cube. - Howida A. Al Fran; David J. W. Simpson; Christopher P. Tuffley (Australas. J Comb., 2019)

Intrinsic linking with linking numbers of specified divisibility. - Christopher P. Tuffley (Ars Math. Contemp., 2019)

Weakly Linked Embeddings of Pairs of Complete Graphs in $ mathbb{R}^3$. - James Di; Erica Flapan; Spencer Johnson; Daniel Thompson; Christopher P. Tuffley (Electron. J. Comb., 2022)

An Asymmetric Alignment Algorithm for Estimating Ancestor-Descendant Edit Distance for Tandem Repeats. - Atheer A. Matroud; Christopher P. Tuffley; Michael D. Hendy (IEEE ACM Trans. Comput. Biol. Bioinform., 2022)