Search the dblp DataBase

Publications of Author

1. Michael D. Hendy, Barbara R. Holland
   Upper bounds on maximum likelihood for phylogenetic trees. [Citation Graph (0, 0)][DBLP]
   ECCB, 2003, pp:66-72 [Conf]
   
2. M. D. Woodhams, Michael D. Hendy
   Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood. [Citation Graph (0, 0)][DBLP]
   ISMB/ECCB (Supplement of Bioinformatics), 2004, pp:348-354 [Conf]
   
3. Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny
   Multiple maxima of likelihood in phylogenetic trees: an analytic approach. [Citation Graph (0, 0)][DBLP]
   RECOMB, 2000, pp:108-117 [Conf]
   
4. Benny Chor, Michael D. Hendy, David Penny
   Analytic Solutions for Three-Taxon ML_MC Trees with Variable Rates Across Sites. [Citation Graph (0, 0)][DBLP]
   WABI, 2001, pp:204-213 [Conf]
   
5. 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. [Citation Graph (0, 0)][DBLP]
   Bioinformatics, 2003, v:19, n:7, pp:865-873 [Journal]
   
6. David Penny, Michael D. Hendy
   TurboTree: a fast algorithm for minimal trees. [Citation Graph (0, 0)][DBLP]
   Computer Applications in the Biosciences, 1987, v:3, n:3, pp:183-187 [Journal]
   
7. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh
   Chromatically Unique Multibridge Graphs. [Citation Graph (0, 0)][DBLP]
   Electr. J. Comb., 2004, v:11, n:1, pp:- [Journal]
   
8. Mike A. Steel, Michael D. Hendy, David Penny
   Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 1998, v:88, n:1-3, pp:367-396 [Journal]
   
9. Benny Chor, Michael D. Hendy, David Penny
   Analytic solutions for three taxon ML trees with variable rates across sites. [Citation Graph (0, 0)][DBLP]
   Discrete Applied Mathematics, 2007, v:155, n:6-7, pp:750-758 [Journal]
   
10. Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little
    The vertex-cover polynomial of a graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:250, n:1-3, pp:71-78 [Journal]
    
11. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:224, n:1-3, pp:107-124 [Journal]
    
12. 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. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:222, n:1-3, pp:73-88 [Journal]
    
13. Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy
    Non-chordal graphs having integral-root chromatic polynomials II. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:247-253 [Journal]
    
14. Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy
    Chromaticity of some families of dense graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:303-321 [Journal]
    
15. Michael D. Hendy, David Penny
    Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock Assumption. [Citation Graph (0, 0)][DBLP]
    Journal of Computational Biology, 1996, v:3, n:1, pp:19-32 [Journal]
    
16. M. Carter, Michael D. Hendy, David Penny, László A. Székely, Nicholas C. Wormald
    On the Distribution of Lengths of Evolutionary Trees. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1990, v:3, n:1, pp:38-47 [Journal]
    
17. Michael D. Hendy
    A combinatorial description of the closest tree algorithm for finding evolutionary trees. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:96, n:1, pp:51-58 [Journal]
    
18. 
    Compressing DNA sequence databases with coil. [Citation Graph (, )][DBLP]