Michael D. Hendy

From MaRDI portal
Person:1281781

Available identifiers

zbMath Open hendy.michael-dMaRDI QIDQ1281781

List of research outcomes

PublicationDate of PublicationType
Testing fundamental evolutionary hypotheses2020-05-06Paper
A fast and simple algorithm for finding the modes of a multinomial distribution2009-12-10Paper
Analytic solutions for three taxon ML trees with variable rates across sites2007-04-18Paper
https://portal.mardi4nfdi.de/entity/Q54716232006-06-14Paper
https://portal.mardi4nfdi.de/entity/Q48205232004-10-15Paper
Chromatically unique multibridge graphs2004-02-05Paper
Analytic Solutions for Three-Taxon MLMC Trees with Variable Rates Across Sites2003-04-06Paper
Chromaticity of some families of dense graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q45295182002-09-20Paper
The vertex-cover polynomial of a graph2002-08-29Paper
Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45295202002-06-10Paper
Non-chordal graphs having integral-root chromatic polynomials. II2002-05-15Paper
https://portal.mardi4nfdi.de/entity/Q27782642002-03-13Paper
Chromatically unique bipartite graphs with low 3-independent partition numbers2001-06-28Paper
An attempt to classify bipartite graphs by chromatic polynomials2000-09-14Paper
On the number of vertices and edges of the Buneman graph1999-10-05Paper
Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results1999-03-22Paper
A discrete Fourier analysis for evolutionary trees.1994-07-11Paper
Spectral analysis of phylogenetic data1993-08-17Paper
Spectral analysis and a closest tree method for genetic sequences1993-04-01Paper
Significance of the length of the shortest tree1993-02-04Paper
https://portal.mardi4nfdi.de/entity/Q40171621993-01-16Paper
A combinatorial description of the closest tree algorithm for finding evolutionary trees1992-06-28Paper
Minimally colored trees1990-01-01Paper
Distribution of the number of matches between nucleotide sequences1990-01-01Paper
Edge lengths of trees from sequence data1987-01-01Paper
Comparing Trees with Pendant Vertices Labelled1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221251984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33221511984-01-01Paper
Branch and bound algorithms to determine minimal evolutionary trees1982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39046581981-01-01Paper
The Jacobi-Perron Algorithm in Integer Form1981-01-01Paper
Proving phylogenetic trees minimal with l-clustering and set partitioning1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38742901980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38939591980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41526031978-01-01Paper
Determining the Fundamental Unit of a Pure Cubic Field Given Any Unit1978-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41734591977-01-01Paper
Euclid and the fundamental theorem of arithmetic1975-01-01Paper
The Distribution of Ideal Class Numbers of Real Quadratic Fields1975-01-01Paper
Applications of a Continued Fraction Algorithm to Some Class Number Problems1974-01-01Paper
Prime Quadratics Associated with Complex Quadratic Fields of Class Number Two1974-01-01Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Michael D. Hendy