#### Filter Results:

- Full text PDF available (43)

#### Publication Year

1992

2016

- This year (0)
- Last 5 years (13)
- Last 10 years (29)

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

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

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

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

We prove that all Paley graphs can be decomposed into Hamilton cycles. This paper is dedicated to Gert Sabidussi in celebration of his 80th birthday.

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

Email and RSS alerting Sign up for email alerts, and subscribe to this journal's RSS feeds at http://nar.oxfordjournals.org image downloads PowerPoint® Images from this journal can be downloaded with one click as a PowerPoint slide. ABSTRACT Despite the success of conventional Sanger sequencing, signi®cant regions of many genomes still present major… (More)

- 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)

- Darryn E. Bryant, Barbara M. Maenhaut, Ian M. Wanless
- J. Comb. Theory, Ser. A
- 2002

A 1-factorisation of a graph is perfect if the union of any two of its 1-factors is a Hamiltonian cycle. Let n=p 2 for an odd prime p. We construct a family of (p − 1)/2 non-isomorphic perfect 1-factorisations of K n, n. Equivalently, we construct pan-Hamiltonian Latin squares of order n. A Latin square is pan-Hamilto-nian if the permutation defined by any… (More)

- 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)

- Darryn E. Bryant, Hung-Lin Fu
- Discrete Mathematics
- 2002

Let H be a graph. A graph G is said to be H-free if it contains no subgraph isomorphic to H. A graph G is said to be an H-saturated subgraph of a graph K if G is an H-free subgraph of K with the property that for any edge e ∈ E(K) \ E(G); G ∪ {e} is not H-free. We present some general results on Ks;t-saturated subgraphs of the complete bipartite graph Km;n… (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 2 − k cells diierent in all three latin squares, denoted by I 3 [n], is determined here for all orders n.