A robust model for finding optimal evolutionary trees

DOI10.1145/167088.167132zbMath1310.92037OpenAlexW2012628879MaRDI QIDQ5248480

Martin Farach, Sampath Kannan, Tandy J. Warnow

Publication date: 7 May 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Theory of computing - STOC '93 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/167088.167132

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problems related to evolution (92D15) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (5)

Analysis of the Period Recovery Error Bound ⋮ Unnamed Item ⋮ L-Infinity Optimization to Bergman Fans of Matroids with an Application to Phylogenetics ⋮ Unnamed Item ⋮ Approximation Algorithms for Low-Distortion Embeddings into Low-Dimensional Spaces

This page was built for publication: A robust model for finding optimal evolutionary trees