On the complexity of inferring rooted evolutinary trees

MaRDI QIDQ2741464zbMATH OpenFDO

Authors Jesper Jansson

Publication date 24 October 2001

Full work available at URL http://www.elsevier.nl/gej-ng/31/29/24/39/23/show/Products/notes/index.htt#023

Mathematics Subject Classification ID

Complexity and performance of numerical algorithms (65Y20) Problems related to evolution (92D15)

Cited in

(9)

• The Complexity of Rooted Phylogeny Problems
• Complexity of Hierarchical Trees in Evidence Theory
• On the hardness of inferring phylogenies from triplet-dissimilarities
• Indirect identification of horizontal gene transfer
• Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees
• Research in Computational Molecular Biology
• Evolutionary trees can be learned in polynomial time in the two-state general Markov model
• The number of evolutionary steps on random and minimum length trees for random evolutionary data
• The complexity of comparing multiply-labelled trees by extending phylogenetic-tree metrics

This page was built for publication: On the complexity of inferring rooted evolutinary trees

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