scientific article; zbMATH DE number 1256739

MaRDI QIDQ4228475zbMATH OpenFDO

Authors Martin Farach, Sampath Kannan

Publication date 4 May 1999

zbMATH Keywords

DNAmaximum likelihood estimationsmetricpolynomial-time algorithm

Mathematics Subject Classification ID

Signal detection and filtering (aspects of stochastic processes) (60G35) Computing methodologies and applications (68U99) Computational methods for problems pertaining to biology (92-08) Problems related to evolution (92D15)

Recommendations

• Efficient algorithms for inverting evolution
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
• Research in Computational Molecular Biology
• An algorithm for the maximum likelihood problem on evolutionary trees
• Phase transition in the sample complexity of likelihood-based phylogeny inference

Cited in

(11)

• Reconstructing phylogenies from nucleotide pattern probabilities: A survey and some new results
• Retractions of finite distance functions onto tree metrics
• Inverting random functions
• Inferring evolutionary trees with strong combinatorial evidence
• Program reversals for evolutions with non-uniform step costs
• A few logs suffice to build (almost) all trees. II
• Efficient algorithms for inverting evolution
• A few logs suffice to build (almost) all trees (I)
• Constructing big trees from short sequences
• Inverting random functions. III: Discrete MLE revisited
• On the variational distance of two trees

This page was built for publication:

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