#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1992

2017

- This year (3)
- Last 5 years (20)
- Last 10 years (36)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Darryn E. Bryant, Heather Gavlas, Alan C. H. Ling
- Electr. J. Comb.
- 2003

Cyclic m-cycle systems of order v are constructed for all m ≥ 3, and all v ≡ 1(mod 2m). This result has been settled previously by several authors. In this paper, we provide a different solution, as a consequence of a more general result, which handles all cases using similar methods and which also allows us to prove necessary and sufficient conditions for… (More)

- Brian Alspach, Darryn E. Bryant, Danny Dyer
- Discrete Mathematics
- 2012

We prove that all Paley graphs can be decomposed into Hamilton cycles.

- Jonathan M. Keith, Peter Adams, +4 authors Gita H. Lala
- Bioinformatics
- 2002

MOTIVATION
A consensus sequence for a family of related sequences is, as the name suggests, a sequence that captures the features common to most members of the family. Consensus sequences are important in various DNA sequencing applications and are a convenient way to characterize a family of molecules.
RESULTS
This paper describes a new algorithm for… (More)

- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Ebadollah S. Mahmoodian
- Discrete Mathematics
- 2002

The set of integers k for which there exist three latin squares of order n having precisely k cells identical, with their remaining n − k cells di2erent in all three latin squares, denoted by I [n], is determined here for all orders n. In particular, it is shown that I [n] = {0; : : : ; n2−15}∪ {n2 − 12; n − 9; n2}; for n¿ 8. c © 2002 Elsevier Science B.V.… (More)

- Peter Adams, Darryn E. Bryant, Abdollah Khodkar
- Discrete Mathematics
- 2000

- Darryn E. Bryant, Barbara M. Maenhaut, Kathleen A. S. Quinn, Bridget S. Webb
- Discrete Mathematics
- 2004

- Darryn E. Bryant
- Australasian J. Combinatorics
- 1997

This paper gives a complete answer to the question: For which values of v and s does there exist a graph G, having v non-isolated vertices, and a pair of disjoint sets of s triangles each forming a partition of the edge set of G?

- Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Martin Macaj
- Graphs and Combinatorics
- 2004

- Jonathan M Keith, Duncan A E Cochran, Gita H Lala, Peter Adams, Darryn Bryant, Keith R Mitchelson
- Nucleic acids research
- 2004

Despite the success of conventional Sanger sequencing, significant regions of many genomes still present major obstacles to sequencing. Here we propose a novel approach with the potential to alleviate a wide range of sequencing difficulties. The technique involves extracting target DNA sequence from variants generated by introduction of random mutations.… (More)

- Peter Adams, Elizabeth J. Billington, Darryn E. Bryant, Saad El-Zanati
- Graphs and Combinatorics
- 2002