Michael D. Hendy

发表

Sharp bounds for the number of 3‐independent partitions and the chromaticity of bipartite graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2001, J. Graph Theory.

Chromatically unique bipartite graphs with low 3-independent partition numbers

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

Hadamard conjugation: an analytic tool for phylogenetics

Michael D. Hendy, 2007, Mathematics of Evolution and Phylogeny.

TurboTree: a fast algorithm for minimal trees

Michael D. Hendy, David Penny, 1987, Comput. Appl. Biosci..

Analytic solutions for three taxon ML trees with variable rates across sites

Michael D. Hendy, Benny Chor, David Penny, 2007, Discret. Appl. Math..

A combinatorial description of the closest tree algorithm for finding evolutionary trees

Michael D. Hendy, M. Hendy, 1991, Discret. Math..

Reconstructing Trees When Sequence Sites Evolve at Variable Rates

László A. Székely, Mike A. Steel, Michael D. Hendy, 1994, J. Comput. Biol..

Two invariants for adjointly equivalent graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

Chromaticity of some families of dense graphs

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

Graph-functions associated with an edge-property

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2004, Australas. J Comb..

Chromatically Unique Multibridge Graphs

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2004, Electron. J. Comb..

Compressing DNA sequence databases with coil

Michael D. Hendy, W. Timothy J. White, 2007, BMC Bioinformatics.

The vertex-cover polynomial of a graph

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Discret. Math..

A Search for H/ACA SnoRNAs in Yeast Using MFE Secondary Structure Prediction

Vincent Moulton, Paul P. Gardner, Michael D. Hendy, 2003, Bioinform..

A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats

David Bryant, Michael D. Hendy, Christopher P. Tuffley, 2012, BSB.

Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets

Sagi Snir, Michael D. Hendy, M. Hendy, 2005, IEEE/ACM Transactions on Computational Biology and Bioinformatics.

Multiple maxima of likelihood in phylogenetic trees: an analytic approach

Barbara R. Holland, Michael D. Hendy, Benny Chor, 2000, RECOMB '00.

Zeros of adjoint polynomials of paths and cycles

Feng Ming Dong, Charles H. C. Little, Kee L. Teo, 2002, Australas. J Comb..

Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results

Mike A. Steel, Michael D. Hendy, David Penny, 1998, Discret. Appl. Math..

Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock Assumption

Michael D. Hendy, David Penny, 1996, J. Comput. Biol..

Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood

Michael D. Hendy, M. D. Woodhams, M. Hendy, 2004, ISMB/ECCB.

Upper bounds on maximum likelihood for phylogenetic trees

Barbara R. Holland, Michael D. Hendy, M. Hendy, 2003, ECCB.

Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites

Michael D. Hendy, Benny Chor, David Penny, 2001, WABI.

Non-chordal graphs having integral-root chromatic polynomials II

Feng Ming Dong, Khee Meng Koh, Kee L. Teo, 2002, Discret. Math..

An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats

Michael D. Hendy, Christopher P. Tuffley, Atheer A. Matroud, 2010, RECOMB-CG.

On the Distribution of Lengths of Evolutionary Trees

Nicholas C. Wormald, László A. Székely, Michael D. Hendy, 1990, SIAM J. Discret. Math..

An attempt to classify bipartite graphs by chromatic polynomials

Feng Ming Dong, Charles H. C. Little, Khee Meng Koh, 2000, Discret. Math..

The path sets of weighted partially labelled trees

Michael D. Hendy, 1992, Australas. J Comb..

An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats in Biological Sequences

Michael D. Hendy, Christopher P. Tuffley, Atheer A. Matroud, 2011, J. Comput. Biol..

Edge lengths of trees from sequence data

Michael D. Hendy, David Penny, 1987 .

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs

Kok Lay Teo, Fengming Dong, Charles H. C. Little, 2001 .

IsProchlorothrix hollandica the best choice as a prokaryotic model for higher plant Chla/b photosynthesis?

Michael D. Hendy, Peter J. Lockhart, David Penny, 1993, Photosynthesis Research.

Hadamard conjugation: a versatile tool for modelling nucleotide sequence evolution

Michael D. Hendy, Michael A. Charleston, M. Hendy, 1993 .

Mathematical Elegance with Biochemical Realism: The Covarion Model of Molecular Evolution

Michael D. Hendy, Michael A. Charleston, David Penny, 2001, Journal of Molecular Evolution.

A Framework for the Quantitative Study of Evolutionary Trees

Michael D. Hendy, David Penny, D. Penny, 1989 .

Parsimony Can Be Consistent

Michael D. Hendy, Mike Steel, David Penny, 1993 .

The Power of Relative Rates Tests Depends on the Data

Michael D. Hendy, David Penny, Andrew Rambaut, 2000, Journal of Molecular Evolution.

Phylogenetics: Parsimony and Distance Methods

Michael D. Hendy, David Penny, 2004 .

The sampling distributions and covariance matrix of phylogenetic spectra

Michael D. Hendy, David Penny, Peter J. Waddell, 1994 .

SPECTRAL ANALYSIS AND A CLOSEST TREE METHOD FOR GENETIC SEQUENCES

László A. Székely, Michael D. Hendy, Mike Steel, 1992 .

Significance of the length of the shortest tree

Michael D. Hendy, Mike Steel, David Penny, 1992 .

Mutation and Evolutionary Rates in Adélie Penguins from the Antarctic

Michael D. Hendy, David M. Lambert, Carlo Baroni, 2008, PLoS genetics.