Robustness of Greedy Type Minimum Evolution Algorithms

DOI10.1007/11758525_109MaRDI QIDQ3545136zbMATH OpenOpenAlexFDO

Authors Takeya Shigezumi

Publication date 9 December 2008

Published in Computational Science – ICCS 2006 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11758525_109

Mathematics Subject Classification ID

Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Problems related to evolution (92D15) Computational methods for problems pertaining to biology (92-08)

Recommendations

• Robustness of phylogenetic inference based on minimum evolution
• scientific article; zbMATH DE number 1945176
• The minimum evolution problem: Overview and classification
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope
• Minimum evolution using ordinary least-squares is less robust than neighbor-joining

Cited in

(2)

• Robustness of phylogenetic inference based on minimum evolution
• Optimality of the neighbor joining algorithm and faces of the balanced minimum evolution polytope

This page was built for publication: Robustness of Greedy Type Minimum Evolution Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3545136)