Efficient algorithms for inverting evolution

DOI10.1145/320211.320212MaRDI QIDQ3158544zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• scientific article; zbMATH DE number 1256739
• Inverting random functions
• An algorithm for the maximum likelihood problem on evolutionary trees
• Research in Computational Molecular Biology
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model

Cited in

(10)

• On the variational distance of two trees
• scientific article; zbMATH DE number 1945171 (Why is no real title available?)
• Characterizing local optima for maximum parsimony
• Reconstructing ultrametric trees from noisy experiments
• Fitting distances by tree metrics minimizing the total error within a constant factor
• Statistical Inference in Evolutionary Models of DNA Sequences via the EM Algorithm
• Inverting Random Functions II: Explicit Bounds for Discrete Maximum Likelihood Estimation, with Applications
• Combining polynomial running time and fast convergence for the disk-covering method.
• Statistically consistent and computationally efficient inference of ancestral DNA sequences in the TKF91 model under dense taxon sampling
• Inverting random functions. III: Discrete MLE revisited

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3158544)