Efficient algorithms for inverting evolution

DOI10.1145/320211.320212zbMath1065.68662OpenAlexW2066936587MaRDI QIDQ3158544

Martin Farach, Sampath Kannan

Publication date: 25 January 2005

Published in: Journal of the ACM (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Problems related to evolution (92D15) Nonnumerical algorithms (68W05)

Related Items (4)

Combining polynomial running time and fast convergence for the disk-covering method. ⋮ Characterizing local optima for maximum parsimony ⋮ On the variational distance of two trees ⋮ Learning nonsingular phylogenies and hidden Markov models

This page was built for publication: Efficient algorithms for inverting evolution