1. Jonathan Keith, Peter Adams, Darryn E. Bryant, Duncan Cochran, Gita Lala and Keith Mitchelson, Algorithms for Sequence Analysis via Mutagenesis, Bioinformatics (to appear). 2. Jonathan Keith, Duncan Cochran, Gita Lala, Peter Adams, Darryn E. Bryant and Keith Mitchelson, Unlocking hidden genomic sequence, Nucleic Acids Research 32: e35 (2004). 3. Peter Adams, Darryn E. Bryant, James Lefevre and Mary Waterhouse, Some equitably 2-colourable cycle decompositions, Utilitas Mathematica (to appear). 4. Peter Adams, Darryn E. Bryant and Barbara M. Maenhaut, Cube factorizations of complete graphs, Journal of Combinatorial Designs (to appear). 5. Peter Adams, Mohammad Mahdian and E.S. Mahamoodian, On the forced matching numbers of bipartite graphs, Discrete Math (to appear). 6. Duncan Cochran, Gita Lala, Jonathan Keith, Peter Adams, Darryn Bryant and Keith Mitchelson ,Sequencing by aligning mutated DNA fragments, in The Frontiers of Biochip Technologies, Kluwer Publishers (to appear). 7. Peter Adams, Richard Bean and Abdollah Khodkar, A census of critical sets in the latin squares or order at most 6, Ars Combinatoria 68 (2003) 203- 223. 8. Peter Adams, Darryn Bryant, James Lefevre and Mary Waterhouse, Some equitably 3-colourable cycle systems, Discrete Math (to appear). 9. Peter Adams, Darryn Bryant, Stephen Long, Mark Smythe and Tran Trung Tran, Virtual drug discovery using graph theory, Bull. Inst. Combin. Appl. 40 (2004), 100-106. 10. Peter Adams, Elizabeth J. Billington and E.S. Mahmoodian, The simultaneous metamorphosis of small-wheel systems, J. Combin. Math. Combin. Comput. 44, 209-223 (2003). 11. Peter Adams, Darryn E. Bryant, S. El-Zanati, B.M. Maenhaut and C. Vanden Eynden, Least common multiples of cubes, Bull. Inst. Combin. Appl. 38, 45-49 (2003). 12. Peter Adams, Darryn E. Bryant, Saad I. El-Zanati and Heather Gavlas, {K_2, C_5}-factorisations of the complete graph, Graphs and Combinatorics 19, 289-296 (2003). 13. Peter Adams, Darryn E. Bryant and Barbara M. Maenhaut, Common Multiples of complete graphs and a four cycle, Discrete Math. 275, 289-297 (2004) 14. Jonathan Keith, Peter Adams, Darryn E. Bryant, Keith Mitchelson, Duncan Cochran and Gita Lala, Inferring an original sequence from erroneous copies: a Bayesian approach, Proceedings of the 1st Asia-Pacific Bioinformatics Conference Vol 19, 23-28 (2003). 15. Jonathan M. Keith, Peter Adams, Darryn Bryant, Keith R. Mitchelson, Duncan A.E. Cochran and Gita H. Lala, Inferring an original sequence from erroneous copies: two approaches. Asia Pacific Biotechnology News, special issue on Bioinformatics in Asia-Pacific 7, 107-114 (2003). 16. Peter Adams, Roger Eggleton, James MacDougall and E.S. Mahmoodian, Corrections to Steinbach's Posets of Graphs (Orders 5, 6, 7), Bull. Inst. Combin. Appl. 37, 29-34 (2003). 17. Peter Adams and Roger Eggleton, Join and meet digraphs of the poset of graphs of order 5, Congressus Numerantium 154, 165-182 (2002). 18. Peter Adams, Elizabeth J. Billington and C.C.Lindner, The number of 6-cycles in 2-factorizations of K_n, n odd, J. Combin. Math. Combin. Comput. 41, 223-243 (2002). 19. Peter Adams, Darryn E. Bryant and Heather Gavlas, Decompositions of the Complete Graph into Small 2-Regular Graphs, J. Combin. Math. Combin. Comput. 43, 135-146 (2002). 20. Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and Saad I. El- Zanati, On the Hamilton-Waterloo Problem, Graphs and Combinatorics 18 (2002) 1, 31-51. 21. Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and E. S. Mahmoodian, On the possible volumes of mu-way latin trades, Aequationes Mathematicae 63 (2002), 303-320. 22. (*) Jonathan Keith, Peter Adams, Darryn E. Bryant, Dirk Kroese, Keith Mitchelson, Duncan Cochran and Gita Lala, A simulated annealing algorithm for finding consensus sequences, Bioinformatics 18 (2002), 1494- 1499. 23. Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and E.S. Mahmoodian, The three-way intersection problem for latin squares, Discrete Math. 243 (2002), no. 1-3, 1-19. 24. Peter Adams, A. Khodkar and Colin Ramsay, Smallest defining sets for some STS(19), J. Combin. Math. Combin. Comput. 37 (2001), 225-237. 25. Peter Adams, Richard Bean and A. Khodkar, Disjoint critical sets in Latin squares, Congressus Numerantium 153 (2001), 33-48. 26. Peter Adams, Elizabeth J. Billington, Darryn E. Bryant and A. Khodkar, The mu-way intersection problem for m-cycle systems, Discrete Math. 231 (2001) 27-56. 27. Peter Adams and A. Khodkar, Smallest critical sets for the latin squares of orders 6 and 7, J. Combin. Math. Combin. Comput. 37 (2001) 225-237. 28. Peter Adams and A. Khodkar, Smallest weak and smallest totally weak critical sets in the latin squares of order at most seven, Ars Combinatoria 61 (2001), 287-300. 29. Peter Adams and A. Khodkar, On the direct product of two weak uniquely completable partial latin squares, Utilitas Mathematica 60 (2001), 249-253. 30. Peter Adams, Darryn E. Bryant and Sean Byrnes, Applications of graph theory in DNA Sequencing by Hybridization, Bull. Inst. Combin. Appl., 31 (2001) 13-20. 31. Peter Adams and Darryn E. Bryant, The mu-way intersection problem for cubes, Australas. J. Combin, 23 (2001) 87-100. 32. Peter Adams and A. Khodkar, Smallest critical sets for the groups of size eight, J. Combin. Math. Combin. Comput. 32 (2000) 23-32. 33. Peter Adams, Darryn E. Bryant and A. Khodkar, The fine structure of (v,3) directed triple systems: v equivalent to 2 (mod 3), Ars Combinatoria 57 (2000) 3-11. 34. Peter Adams, Elizabeth J. Billington, I.J. Dejter and C.C. Lindner, The number of 4-cycles in 2-factorizations of K_{2n} minus a 1-factor, Discrete Math. 220 (2000) 1-11. 35. Peter Adams, Darryn E. Bryant and A. Khodkar, On Alspach's conjecture with two even cycle lengths, Discrete Math. 223 (2000) 1-12. 36. Peter Adams, Darryn E. Bryant and A. Khodkar, The fine structure of balanced ternary designs with block size three, index three and rho_2=1,2, Ars Combinatoria 56 (2000) 299-308. 37. Peter Adams, Darryn E. Bryant and A. Khodkar, The spectrum problem for lambda-fold Petersen graph designs, J Combin. Math. Combin. Comput. 34 (2000) 159-176. 38. Peter Adams, Darryn E. Bryant and A. Khodkar, The spectrum problem for closed m-trails, m<=10, J Combin. Math. Combin. Comput. 34 (2000) 223-240. 39. Peter Adams, Darryn E. Bryant and A. Khodkar, On the number of repeated triples in balanced ternary designs with index two, Utilitas Mathematica 55 (1999) 55-64. 40. G.J. McLachlan, D. Peel, K.E. Basford and Peter Adams, The EMMIX software for the fitting of mixtures of normal and t-components, Journal of Statistical Software 4 (1999) Number 2. 41. Peter Adams, Darryn E. Bryant and S. El-Zanati, Packing and covering the complete graph with cubes, Australas. J. Combin. 20 (1999) 267-288. 42. (*). Peter Adams, Darryn E. Bryant and A. Khodkar, 3,5-cycle decompositions, Journal of Combinatorial Designs 6 (1998) 91-110. 43. Peter Adams, Darryn E. Bryant and A. Khodkar, Uniform 3- Factorisations of K10, Congressus Numerantium 127 (1997) 23-32. 44. Peter Adams and Darryn E. Bryant, The spectrum problem for the Heawood graph, Bull. Inst. Combin. Appl. 19 (1997), 17-22. 45. Peter Adams, Darryn E. Bryant, S. El-Zanati and C. Vanden Eynden, d- cube decompositions of K_n \ K_m, Graphs and Combinatorics 13 (1997) 1-7. 46. (*) Peter Adams, Elizabeth J. Billington and Dean G. Hoffman, On the spectrum for Km+2 \ Km designs, Journal of Combinatorial Designs 5 (1) (1997) 49-60. 47. (*) McGiffin, D.C., Galbraith, A.J., O'Brien, M.F., McLachlan, G.J., Naftel, D.C., Adams, P., Reddy, S., and Early, L. An analysis of valve re- replacement following aortic valve replacement with biological devices, Journal of Thoracic and Cardiovascular Surgery 113 (1997) 311-318. 48. Diane Donovan, Adelle Howse and Peter Adams, A discussion of Latin Interchanges, J Combin. Math. Combin. Comput. 23 (1997) 161-182. 49. Peter Adams, Darryn E. Bryant, A. Khodkar and S. El-Zanati, The intersection problem for cubes, Australas. J. Combin. 15 (1997) 127-134. 50. Peter Adams and Darryn E. Bryant, i-perfect m-cycle systems, m<=19, Aequationes Mathematicae 53 (1997) 275-294. 51. McLachlan, G.J., Ng, S.K., Adams, P., McGiffin, D.C., and Galbraith, A.J. An algorithm for fitting mixtures of Gompertz distributions to censored survival data, Journal of Statistical Software 2 (1997), No. 7. 52. Peter Adams, Combinatorial designs and related computational constructions, (abstract) Bull. Austral. Math. Soc. 53 (1996) 521-523. 53. Peter Adams and Elizabeth J. Billington, Lambda-fold 3-perfect 9-cycle systems, Ars Combinatoria 44 (1996) 241-262. 54. Peter Adams, Elizabeth J. Billington and Darryn E. Bryant, Partitionable perfect cycle systems with cycle lengths 6 and 8, Discrete Math. 149 (1996) 1-9. 55. Peter Adams and Darryn E. Bryant, The spectrum for Petersen graph decompositions, Journal of Graph Theory 22 2 (1996) 175-180. 56. Peter Adams and Darryn E. Bryant, Decomposing the complete graph into Platonic graphs, Bull. Inst. Combin. Appl. 17 (1996), 19-26. 57. Peter Adams, Darryn E. Bryant and Abdollah Khodkar, On super- simple designs with block size 4, Aequationes Mathematicae 51 (1996), 230-246. 58. Peter Adams, Elizabeth J. Billington and Darryn E. Bryant, Lambda- fold Steiner pentagon systems, Journal of Statistical Planning and Inference 56 (1996) 3-15. 59. Peter Adams, Combinatorial designs and related computational constructions, PhD thesis, The University of Queensland, (1995). 60. Peter Adams, Decomposing a complete graph into a golf schedule, Bull. Inst. Combin. Appl. 14 (1995), 101-103 61. Peter Adams and Darryn E. Bryant, Cyclically generated m-trail systems of order 2m+1, m <= 10, J. Combin. Math. Combin. Comput. 17 (1995), 3-19. 62. Peter Adams, Darryn E. Bryant and S. El-Zanati, Lambda-fold cube decompositions, Australas. J. Combin. 11 (1995), 197-210. 63. Darryn E. Bryant and Peter Adams, Decomposing the complete graph into cycles of many lengths, Graphs and Combinatorics 11 (1995), 97-102. 64. Peter Adams, Elizabeth J. Billington and C.C. Lindner, k-perfect 3k- cycle systems, J. Combin. Math. Combin. Comput. 15 (1994), 141-154. 65. Peter Adams, Elizabeth J. Billington and C.A. Rodger, Pasch configurations of lambda-fold triple systems, J. Combin. Math. Combin. Comput. 15 (1994), 53-63. 66. Peter Adams and Elizabeth J. Billington, Completing some spectra for 2-perfect cycle systems, Australas. J. Combin. 7 (1993), 175-187. 67. Peter Adams, Lambda-fold 2-perfect 8-cycle systems, Utilitas Mathematica 43 (1993), 171-204. 68. Darryn E. Bryant and Peter Adams, 2-perfect closed m-trail systems of the complete directed graph with loops, Australas. J. Combin. 8 (1993), 127-142. 69. Peter Adams and Elizabeth J. Billington, The spectrum for 2-perfect 8- cycle systems, Ars Combinatoria 36 (1993), 47-56 70. Peter Adams, Lambda-fold 2-perfect bowties, Utilitas Mathematica 44 (1993), 243-253. 71. Peter Adams, Elizabeth J. Billington and C.C. Lindner, The spectrum for 3-perfect 9-cycle systems, Australas. J. Combin. 5 (1992), 103-108.