2008 |
18 | EE | Michael D. Hendy,
Sagi Snir:
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(3): 461-471 (2008) |
2007 |
17 | EE | Benny Chor,
Michael D. Hendy,
David Penny:
Analytic solutions for three taxon ML trees with variable rates across sites.
Discrete Applied Mathematics 155(6-7): 750-758 (2007) |
2004 |
16 | EE | M. D. Woodhams,
Michael D. Hendy:
Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood.
ISMB/ECCB (Supplement of Bioinformatics) 2004: 348-354 |
15 | EE | Feng Ming Dong,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy,
Khee Meng Koh:
Chromatically Unique Multibridge Graphs.
Electr. J. Comb. 11(1): (2004) |
2003 |
14 | | Michael D. Hendy,
Barbara R. Holland:
Upper bounds on maximum likelihood for phylogenetic trees.
ECCB 2003: 66-72 |
13 | | Sverker Edvardsson,
Paul P. Gardner,
Anthony M. Poole,
Michael D. Hendy,
David Penny,
Vincent Moulton:
A Search for H/ACA SnoRNAs in Yeast Using MFE Secondary Structure Prediction.
Bioinformatics 19(7): 865-873 (2003) |
2002 |
12 | EE | Feng Ming Dong,
Kee L. Teo,
Khee Meng Koh,
Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II.
Discrete Mathematics 245(1-3): 247-253 (2002) |
11 | EE | Feng Ming Dong,
Michael D. Hendy,
Kee L. Teo,
Charles H. C. Little:
The vertex-cover polynomial of a graph.
Discrete Mathematics 250(1-3): 71-78 (2002) |
10 | EE | Feng Ming Dong,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
Chromaticity of some families of dense graphs.
Discrete Mathematics 258(1-3): 303-321 (2002) |
2001 |
9 | EE | Benny Chor,
Michael D. Hendy,
David Penny:
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites.
WABI 2001: 204-213 |
2000 |
8 | EE | Benny Chor,
Michael D. Hendy,
Barbara R. Holland,
David Penny:
Multiple maxima of likelihood in phylogenetic trees: an analytic approach.
RECOMB 2000: 108-117 |
7 | EE | Feng Ming Dong,
Khee Meng Koh,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
An attempt to classify bipartite graphs by chromatic polynomials.
Discrete Mathematics 222(1-3): 73-88 (2000) |
6 | EE | Feng Ming Dong,
Khee Meng Koh,
Kee L. Teo,
Charles H. C. Little,
Michael D. Hendy:
Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discrete Mathematics 224(1-3): 107-124 (2000) |
1998 |
5 | EE | Mike A. Steel,
Michael D. Hendy,
David Penny:
Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results.
Discrete Applied Mathematics 88(1-3): 367-396 (1998) |
1996 |
4 | | Michael D. Hendy,
David Penny:
Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock Assumption.
Journal of Computational Biology 3(1): 19-32 (1996) |
1991 |
3 | EE | Michael D. Hendy:
A combinatorial description of the closest tree algorithm for finding evolutionary trees.
Discrete Mathematics 96(1): 51-58 (1991) |
1990 |
2 | | M. Carter,
Michael D. Hendy,
David Penny,
László A. Székely,
Nicholas C. Wormald:
On the Distribution of Lengths of Evolutionary Trees.
SIAM J. Discrete Math. 3(1): 38-47 (1990) |
1987 |
1 | | David Penny,
Michael D. Hendy:
TurboTree: a fast algorithm for minimal trees.
Computer Applications in the Biosciences 3(3): 183-187 (1987) |