A fast algorithm for constructing trees from distance matrices

A robust model for finding optimal evolutionary trees

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing

Trees and Euclidean metrics

STOC '98 Proceedings of the thirtieth annual ACM symposium on Theory of computing

Inferring evolutionary trees from ordinal data

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms

Testing metric properties

STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing

Efficient Merging, Construction, and Maintenance of Evolutionary Trees

ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming

Testing metric properties

Information and Computation

On the longest path algorithm for reconstructing trees from distance matrices

Information Processing Letters

Fast and reliable reconstruction of phylogenetic trees with very short edges

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms

Reconstruction of graphs based on random walks

Theoretical Computer Science

Balanced randomized tree splitting with applications to evolutionary tree constructions

STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science

Fast and reliable reconstruction of phylogenetic trees with indistinguishable edges

Random Structures & Algorithms

Tree topology inference from leaf-to-leaf path lengths using Prüfer sequence

International Journal of Communication Networks and Distributed Systems