default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichael D. Hendy
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
[j24]Atheer A. Matroud
, Christopher P. Tuffley, Michael D. Hendy:
An Asymmetric Alignment Algorithm for Estimating Ancestor-Descendant Edit Distance for Tandem Repeats. IEEE ACM Trans. Comput. Biol. Bioinform. 19(4): 2080-2091 (2022)
2010 – 2019
- 2012
- [c6]Atheer A. Matroud, Christopher P. Tuffley, David Bryant, Michael D. Hendy:
A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats. BSB 2012: 37-48 - 2011
- [j23]Atheer A. Matroud, Christopher P. Tuffley, Michael D. Hendy:
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats in Biological Sequences. J. Comput. Biol. 18(9): 1211-1218 (2011) - 2010
- [c5]Atheer A. Matroud, Michael D. Hendy, Christopher P. Tuffley:
An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats. RECOMB-CG 2010: 188-197
2000 – 2009
- 2008
- [j22]W. Timothy J. White, Michael D. Hendy:
Compressing DNA sequence databases with coil. BMC Bioinform. 9 (2008) - [j21]Michael D. Hendy, Sagi Snir:
Hadamard Conjugation for the Kimura 3ST Model: Combinatorial Proof Using Path Sets. IEEE ACM Trans. Comput. Biol. Bioinform. 5(3): 461-471 (2008) - 2007
- [j20]Benny Chor, Michael D. Hendy, David Penny:
Analytic solutions for three taxon ML trees with variable rates across sites. Discret. Appl. Math. 155(6-7): 750-758 (2007) - [p1]Michael D. Hendy:
Hadamard conjugation: an analytic tool for phylogenetics. Mathematics of Evolution and Phylogeny 2007 - 2004
- [j19]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
Graph-functions associated with an edge-property. Australas. J Comb. 30: 3-20 (2004) - [j18]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy, Khee Meng Koh:
Chromatically Unique Multibridge Graphs. Electron. J. Comb. 11(1) (2004) - [c4]M. D. Woodhams, Michael D. Hendy:
Reconstructing phylogeny by Quadratically Approximated Maximum Likelihood. ISMB/ECCB (Supplement of Bioinformatics) 2004: 348-354 - 2003
- [j17]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. Bioinform. 19(7): 865-873 (2003) - [c3]Michael D. Hendy, Barbara R. Holland:
Upper bounds on maximum likelihood for phylogenetic trees. ECCB 2003: 66-72 - 2002
- [j16]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Two invariants for adjointly equivalent graphs. Australas. J Comb. 25: 133-144 (2002) - [j15]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Zeros of adjoint polynomials of paths and cycles. Australas. J Comb. 25: 167-174 (2002) - [j14]Feng Ming Dong, Kee L. Teo, Khee Meng Koh, Michael D. Hendy:
Non-chordal graphs having integral-root chromatic polynomials II. Discret. Math. 245(1-3): 247-253 (2002) - [j13]Feng Ming Dong, Michael D. Hendy, Kee L. Teo, Charles H. C. Little:
The vertex-cover polynomial of a graph. Discret. Math. 250(1-3): 71-78 (2002) - [j12]Feng Ming Dong, Kee L. Teo, Charles H. C. Little, Michael D. Hendy:
Chromaticity of some families of dense graphs. Discret. Math. 258(1-3): 303-321 (2002) - 2001
- [j11]Feng Ming Dong, Khee Meng Koh, Kee L. Teo, C. H. C. Little, Michael D. Hendy:
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs. J. Graph Theory 37(1): 48-77 (2001) - [c2]Benny Chor, Michael D. Hendy, David Penny:
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites. WABI 2001: 204-213 - 2000
- [j10]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. Discret. Math. 222(1-3): 73-88 (2000) - [j9]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. Discret. Math. 224(1-3): 107-124 (2000) - [c1]Benny Chor, Michael D. Hendy, Barbara R. Holland, David Penny:
Multiple maxima of likelihood in phylogenetic trees: an analytic approach. RECOMB 2000: 108-117
1990 – 1999
- 1998
- [j8]Mike A. Steel, Michael D. Hendy, David Penny:
Reconstructing Phylogenies From Nucleotide Pattern Probabilities: A Survey and some New Results. Discret. Appl. Math. 88(1-3): 367-396 (1998) - 1996
- [j7]Michael D. Hendy, David Penny:
Complete Families of Linear Invariants for Some Stochastic Models of Sequence Evolution, with and without Molecular Clock Assumption. J. Comput. Biol. 3(1): 19-31 (1996) - 1994
- [j6]Michael A. Charleston, Michael D. Hendy, David Penny:
The Effects of Sequence Length, Tree Topology, and Number of Taxa on the Performance of Phylogenetic Methods. J. Comput. Biol. 1(2): 133-151 (1994) - [j5]Mike A. Steel, László A. Székely, Michael D. Hendy:
Reconstructing Trees When Sequence Sites Evolve at Variable Rates. J. Comput. Biol. 1(2): 153-163 (1994) - 1992
- [j4]Michael D. Hendy:
The path sets of weighted partially labelled trees. Australas. J Comb. 5: 277-284 (1992) - 1991
- [j3]Michael D. Hendy:
A combinatorial description of the closest tree algorithm for finding evolutionary trees. Discret. Math. 96(1): 51-58 (1991) - 1990
- [j2]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. Discret. Math. 3(1): 38-47 (1990)
1980 – 1989
- 1987
- [j1]David Penny, Michael D. Hendy:
TurboTree: a fast algorithm for minimal trees. Comput. Appl. Biosci. 3(3): 183-187 (1987)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2025-01-20 23:02 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
