PUMA

academical publication management
collect, organize, and share publications

( en | de )

 

Disambiguation of "Steel, Michael Anthony"

Author of the publication

copydeleteadd this publication to your clipboard
A few logs suffice to build (almost) all trees (I).

, , , and . Random Struct. Algorithms, 14 (2): 153-184 (1999)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Michael Böhm

Michael Funk

Hon. -Prof. Dr. -Ing. Michael Bauer University of Stuttgart

Dr. Michael Wachowsky University of Stuttgart

Dr. phil. Michael Nerurkar University of Stuttgart

 

Other publications of authors with the same name

A Few Logs Suffice to Build (almost) All Trees: Part II., , , and . Theor. Comput. Sci., 221 (1-2): 77-118 (1999)The Length of a Leaf Coloration on a Random Binary Tree., and . SIAM J. Discrete Math., 10 (3): 359-372 (1997)Four Characters Suffice to Convexly Define a Phylogenetic Tree., , and . SIAM J. Discrete Math., 18 (4): 835-843 (2005)Dissimilarity maps and substitution models: Some new results., , and . Mathematical Hierarchies and Biology, volume 37 of DIMACS Series in Discrete Mathematics and Theoretical Computer Science, page 111-132. DIMACS/AMS, (1996)Symmetric Matrices Representable by Weighted Trees Over a Cancellative Abelian Monoid., and . SIAM J. Discrete Math., 8 (4): 517-525 (1995)Neighborhoods of Phylogenetic Trees: Exact and Asymptotic Counts., , and . SIAM J. Discrete Math., 30 (4): 2265-2287 (2016)Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications., and . SIAM J. Discrete Math., 15 (4): 562-575 (2002)Distribution of the Symmetric Difference Metric on Phylogenetic Trees.. SIAM J. Discrete Math., 1 (4): 541-551 (1988)'Lassoing' a phylogenetic tree I: Basic properties, shellings, and covers, , and . CoRR, (2011)A few logs suffice to build (almost) all trees (I)., , , and . Random Struct. Algorithms, 14 (2): 153-184 (1999)