Determining the Evolutionary Tree Using Experiments

DOI10.1006/jagm.1996.0035zbMath0857.68082OpenAlexW2079970266MaRDI QIDQ4895795

Sampath Kannan, Eugene L. Lawler, Tandy J. Warnow

Publication date: 16 October 1996

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jagm.1996.0035

zbMATH Keywords

evolutionary treesphylogenetic trees

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (13)

Testing metric properties ⋮ A `stochastic safety radius' for distance-based tree reconstruction ⋮ On the longest path algorithm for reconstructing trees from distance matrices ⋮ A constructive algorithm for realizing a distance matrix ⋮ Inferring a level-1 phylogenetic network from a dense set of rooted triplets ⋮ Fast error-tolerant quartet phylogeny algorithms ⋮ Kernel and fast algorithm for dense triplet inconsistency ⋮ Unnamed Item ⋮ Unnamed Item ⋮ New heuristics for rooted triplet consistency ⋮ Fast Error-Tolerant Quartet Phylogeny Algorithms ⋮ The matroid structure of representative triple sets and triple-closure computation ⋮ New results on optimizing rooted triplets consistency

This page was built for publication: Determining the Evolutionary Tree Using Experiments