Algorithms for Computing the Triplet and Quartet Distances for Binary General Trees

Author： Sand Andreas Holt Morten K. Johansen Jens Fagerberg Rolf Brodal Gerth Stølting Pedersen Christian N. S. Mailund Thomas

Publisher： MDPI

E-ISSN： 2079-7737|2|4|1189-1209

ISSN： 2079-7737

Source： Biology, Vol.2, Iss.4, 2013-09, pp. : 1189-1209

Access to resources Favorite

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

Performance of a New Invariants Method on Homogeneous and Nonhomogeneous Quartet Trees

By Casanellas M Fernández-Sánchez J

Molecular Biology and Evolution, Vol. 24, Iss. 1, 2007-01 ,pp. : 288-293

Oxford University Press

Access to resources Recommend Favorite

Testing for Polytomies in Phylogenetic Species Trees Using Quartet Frequencies

By Sayyari Erfan Mirarab Siavash

Genes, Vol. 9, Iss. 3, 2018-02 ,pp. : 132-132

MDPI

Access to resources Recommend Favorite

The Characterization of Topology: A Comparison of Four topological Indices for Rooted Binary Trees

By Berntson G.M.

Journal of Theoretical Biology, Vol. 177, Iss. 3, 1995-12 ,pp. : 271-281

Academic Press

Access to resources Recommend Favorite

A General Technique for Computing Evolutionarily Stable Strategies Based on Errors in Decision-making

By McNamara J.M. Webb J.N. Collins E.J. Szekely T. Houston A.I.

Journal of Theoretical Biology, Vol. 189, Iss. 2, 1997-11 ,pp. : 211-225

Academic Press

Access to resources Recommend Favorite

FastTree: Computing Large Minimum Evolution Trees with Profiles instead of a Distance Matrix

By Price Morgan N. Dehal Paramvir S. Arkin Adam P.

Molecular Biology and Evolution, Vol. 26, Iss. 7, 2009-07 ,pp. : 1641-1650

Oxford University Press

Access to resources Recommend Favorite