( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Multiple maxima of likelihood in phylogenetic trees: an analytic approach.

, , , и . RECOMB, стр. 108-117. ACM, (2000)

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.

Michael D Segeritz

Michael D Swartz

Michael D Menger

Michael d' Orville

Michael D Breitenstein

 

Другие публикации лиц с тем же именем

Sharp bounds for the number of 3-independent partitions and the chromaticity of bipartite graphs., , , , и . J. Graph Theory, 37 (1): 48-77 (2001)TurboTree: a fast algorithm for minimal trees., и . Comput. Appl. Biosci., 3 (3): 183-187 (1987)Progress with Methods for Constructing Evolutionary Trees, , и . Tree, (1992)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)An Algorithm to Solve the Motif Alignment Problem for Approximate Nested Tandem Repeats., , и . RECOMB-CG, том 6398 из Lecture Notes in Computer Science, стр. 188-197. Springer, (2010)Reliability of Evolutionary Trees, , и . Cold Spring Harbor Symposia on Quantitative Biology, (1987)A Comparison of Three Heuristic Methods for Solving the Parsing Problem for Tandem Repeats., , , и . BSB, том 7409 из Lecture Notes in Computer Science, стр. 37-48. Springer, (2012)Two invariants for adjointly equivalent graphs., , , и . Australas. J Comb., (2002)Multiple maxima of likelihood in phylogenetic trees: an analytic approach., , , и . RECOMB, стр. 108-117. ACM, (2000)Chromatically unique bipartite graphs with low 3-independent partition numbers., , , , и . Discret. Math., 224 (1-3): 107-124 (2000)