Michael D. Hendy

31 papers B 1C 2Journal 24Unranked 3
YearRankTypeTitle / Venue / Authors
2022 J jnl
An Asymmetric Alignment Algorithm for Estimating Ancestor-Descendant Edit Distance for Tandem Repeats.
IEEE ACM Trans. Comput. Biol. Bioinform.
Atheer A. Matroud, Christopher P. Tuffley, Michael D. Hendy
2012 — conf
A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats.
BSB
Atheer A. Matroud, Christopher P. Tuffley, David Bryant, Michael D. Hendy
2011 J jnl
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats in Biological Sequences.
J. Comput. Biol.
Atheer A. Matroud, Christopher P. Tuffley, Michael D. Hendy
2010 — conf
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats.
RECOMB-CG
Atheer A. Matroud, Michael D. Hendy, Christopher P. Tuffley
2008 J jnl
Compressing DNA sequence databases with coil.
BMC Bioinform.
W. Timothy J. White, Michael D. Hendy
2008 J jnl
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets.
IEEE ACM Trans. Comput. Biol. Bioinform.
Michael D. Hendy, Sagi Snir
2007 J jnl
Analytic solutions for three taxon ML trees with variable rates across sites.
Discret. Appl. Math.
Benny Chor, Michael D. Hendy, David Penny
2007 — ch.
Hadamard conjugation: an analytic tool for phylogenetics.
Mathematics of Evolution and Phylogeny
Michael D. Hendy
2004 J jnl
Chromatically Unique Multibridge Graphs.
Electron. J. Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
2004 J jnl
Graph-functions associated with an edge-property.
Australas. J Comb.
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2004 — conf
Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood.
ISMB/ECCB (Supplement of Bioinformatics)
M. D. Woodhams, Michael D. Hendy
2003 J jnl
A Search for H/ACA SnoRNAs in Yeast Using MFE Secondary Structure Prediction.
Bioinform.
Sverker Edvardsson, Paul P. Gardner, Anthony M. Poole, Michael D. Hendy, David Penny, Vincent Moulton
2003 C conf
Upper bounds on maximum likelihood for phylogenetic trees.
ECCB
Michael D. Hendy, Barbara R. Holland
2002 J jnl
Chromaticity of some families of dense graphs.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002 J jnl
Non-chordal graphs having integral-root chromatic polynomials II.
Discret. Math.
Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
2002 J jnl
The vertex-cover polynomial of a graph.
Discret. Math.
Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
2002 J jnl
Two invariants for adjointly equivalent graphs.
Australas. J Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2002 J jnl
Zeros of adjoint polynomials of paths and cycles.
Australas. J Comb.
Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2001 C conf
Analytic Solutions for Three-Taxon ML
WABI
Benny Chor, Michael D. Hendy, David Penny
2001 J jnl
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs.
J. Graph Theory
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy
2000 J jnl
An attempt to classify bipartite graphs by chromatic polynomials.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000 J jnl
Chromatically unique bipartite graphs with low 3-independent partition numbers.
Discret. Math.
Feng Ming Dong, Khee Meng Koh, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
2000 B conf
Multiple maxima of likelihood in phylogenetic trees: an analytic approach.
RECOMB
Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny
1998 J jnl
Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results.
Discret. Appl. Math.
Mike A. Steel, Michael D. Hendy, David Penny
1996 J jnl
Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock Assumption.
J. Comput. Biol.
Michael D. Hendy, David Penny
1994 J jnl
Reconstructing Trees When Sequence Sites Evolve at Variable Rates.
J. Comput. Biol.
Mike A. Steel, László A. Székely, Michael D. Hendy
1994 J jnl
The Effects of Sequence Length, Tree Topology, and Number of Taxa on the Performance of Phylogenetic Methods.
J. Comput. Biol.
Michael A. Charleston, Michael D. Hendy, David Penny
1992 J jnl
The path sets of weighted partially labelled trees.
Australas. J Comb.
Michael D. Hendy
1991 J jnl
A combinatorial description of the closest tree algorithm for finding evolutionary trees.
Discret. Math.
Michael D. Hendy
1990 J jnl
On the Distribution of Lengths of Evolutionary Trees.
SIAM J. Discret. Math.
M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
1987 J jnl
TurboTree: a fast algorithm for minimal trees.
Comput. Appl. Biosci.
David Penny, Michael D. Hendy