Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets

DOI10.1137/S009753970037905XzbMath0987.05042OpenAlexW1609447655MaRDI QIDQ2784454

Miklós Csűrös, Ming-Yang Kao

Publication date: 23 April 2002

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/s009753970037905x

zbMATH Keywords

evolutionary treesJukes-Cantor model of evolution

Mathematics Subject Classification ID

Trees (05C05) Problems related to evolution (92D15) Applications of branching processes (60J85) Protein sequences, DNA sequences (92D20) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

Analytic solutions for three taxon ML trees with variable rates across sites ⋮ Alignment-free phylogenetic reconstruction: Sample complexity via a branching process analysis ⋮ The matroid structure of representative triple sets and triple-closure computation

This page was built for publication: Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets