|
2003 Journal Article Inferring an original sequence from erroneous copies: two approachesKeith, J. M., Adams, P., Bryant, D. E., Mitchelson, K. R., Cochran, D.A.E. and Lala, G. H. (2003). Inferring an original sequence from erroneous copies: two approaches. Asia-Pacific Biotech News: Special Issue: Bioinformatics in Asia Pacific, 7 (3), 107-114. doi: 10.1142/s0219030303000284 |
|
2003 Journal Article Skolem-type difference sets for cycle systemsBryant, D., Gavlas, H. and Ling, A. C. H. (2003). Skolem-type difference sets for cycle systems. Electronic Journal of Combinatorics, 10 (1). doi: 10.37236/1731 |
|
2003 Journal Article On the volume of 4-cycle tradesBryant, D., Grannell, M., Griggs, T. and Maenhaut, B. (2003). On the volume of 4-cycle trades. Graphs And Combinatorics, 19 (1), 53-63. doi: 10.1007/s00373-002-0484-x |
|
2002 Journal Article A family of perfect factorisations of complete bipartite graphsBryant, Darryn, Maenhaut, Barbara M. and Wanless, Ian M. (2002). A family of perfect factorisations of complete bipartite graphs. Journal of Combinatorial Theory Series A, 98 (2), 328-342. doi: 10.1006/jcta.2001.3240 |
|
2002 Journal Article A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide librariesTran, T. T., Bryant, D. E. and Smythe, M. L. (2002). A subset-oriented algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries. Computers and Chemistry, 26 (2), 113-117. doi: 10.1016/S0097-8485(01)00087-0 |
|
2002 Journal Article The three-way intersection problem for latin squaresAdams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. S. (2002). The three-way intersection problem for latin squares. Discrete Mathematics, 243 (1-3), 1-19. doi: 10.1016/S0012-365X(00)00454-4 |
|
2002 Journal Article Another quick proof that K10 P + P + PBryant, D. E. (2002). Another quick proof that K10 P + P + P. Bulletin of the Institute of Combinatorics and its Applications, 34, 86-86. |
|
2002 Journal Article Orthogonal quasigroups associated with m-cycle systemsBryant, D. E. and Khodkar, A. (2002). Orthogonal quasigroups associated with m-cycle systems. Bulletin of the Institute of Combinatorics and its Applications, 36, 109-112. |
|
2002 Journal Article On the Hamilton-Waterloo problemAdams, P, Billington, EJ, Bryant, DE and El-Zanati, SI (2002). On the Hamilton-Waterloo problem. Graphs And Combinatorics, 18 (1), 31-51. doi: 10.1007/s003730200001 |
|
2002 Journal Article Two-dimensional balanced sampling plans excluding contiguous unitsBryant, D. E., Chang, Y. X., Rodger, C. A. and Wei, R. (2002). Two-dimensional balanced sampling plans excluding contiguous units. Communications In Statistics-theory And Methods, 31 (8), 1441-1455. doi: 10.1081/STA-120006078 |
|
2002 Journal Article A simulated annealing algorithm for finding consensus sequencesKeith, Jonathan M., Adams, Peter, Bryant, Darryn, Kroese, Dirk P., Mitchelson, Keith R., Cochran, Duncan A. E. and Lala, Gita H. (2002). A simulated annealing algorithm for finding consensus sequences. Bioinformatics, 18 (11), 1494-1499. doi: 10.1093/bioinformatics/18.11.1494 |
|
2002 Journal Article Factorizations of and by powers of complete graphsBryant, D. E., El-Zanati, S. I. and Vanden Eynden, C. (2002). Factorizations of and by powers of complete graphs. Discrete Mathematics, 243 (1-3), 201-205. doi: 10.1016/S0012-365X(01)00216-3 |
|
2002 Journal Article On the possible volumes of mu-way latin tradesAdams, P., Billington, E. J., Bryant, D. E. and Mahmoodian, E. (2002). On the possible volumes of mu-way latin trades. Aequationes Mathematicae, 63 (3), 303-320. doi: 10.1007/s00010-002-8026-4 |
|
2002 Journal Article A conjecture on small embeddings of partial Steiner triple systemsBryant, D (2002). A conjecture on small embeddings of partial Steiner triple systems. Journal of Combinatorial Designs, 10 (5), 313-321. doi: 10.1002/jcd.10017 |
|
2002 Journal Article C4-saturated bipartite graphsBryant, DE and Fu, HL (2002). C4-saturated bipartite graphs. Discrete Mathematics, 259 (1-3), 263-268. doi: 10.1016/S0012-365X(02)00371-0 |
|
2002 Journal Article A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide librariesTran, Tran Trung, Bryant, Darryn and Smythe, Mark (2002). A subset-orientated algorithm for minimizing the number of steps required for synthesis of cyclic-peptide libraries. Computers and Chemistry, 26 (2), 113-7. doi: 10.1016/S0097-8485(01)00087-0 |
|
2002 Journal Article Decompositions of the complete graph into small 2-regular graphsAdams, P., Bryant, D. E. and Gavlas, H. (2002). Decompositions of the complete graph into small 2-regular graphs. Journal of Combinatorial Mathematics and Combinatorial Computing, 43, 135-146. |
|
2001 Journal Article Star decompositions of cubesBryant, Darryn E., El-Zanati, Saad, Vanden Eynden, Charles and Hoffman, Dean G. (2001). Star decompositions of cubes. Graphs Combin, 17 (1), 55-59. doi: 10.1007/s003730170054 |
|
2001 Journal Article Applications of graph theory in DNA sequencing by hybridizationAdams, P., Bryant, D. E. and Byrnes, S. (2001). Applications of graph theory in DNA sequencing by hybridization. Bulletin of the Institute of Combinatorics and its Applications, 31, 13-20. |
|
2001 Journal Article On the Oberwolfach problem with two similar length cyclesBryant, DE (2001). On the Oberwolfach problem with two similar length cycles. Graphs And Combinatorics, 17 (2), 199-206. doi: 10.1007/s003730170033 |
